84 search results - page 1 / 17 » Computing Many Faces in Arrangements of Lines and Segments |
COMPGEOM
1994
ACM
13 years 9 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...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
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...
COMPGEOM
1991
ACM
13 years 8 months ago
1991
ACM
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...
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...