COMGEO
2006
ACM
13 years 4 months ago
2006
ACM
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
AMC
2010
13 years 4 months ago
2010
Let X be a smooth quadric of dimension 2m in P2m+1 C and let Y, Z X be subvarieties both of dimension m which intersect transversely. In this paper we give an algorithm for comput...
CCCG
2007
13 years 6 months ago
2007
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...