30 search results - page 1 / 6 » Crossing edges and faces of line arrangements in the plane |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
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...
COMPGEOM
1994
ACM
13 years 8 months ago
1994
ACM
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
WAE
2000
13 years 6 months ago
2000
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
COMPGEOM
1996
ACM
13 years 8 months ago
1996
ACM
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...