36 search results - page 3 / 8 » Arrangement Computation for Planar Algebraic Curves |
PG
2007
IEEE
13 years 11 months ago
2007
IEEE
We overview a new method for computing the arrangement of semi-algebraic curves. A subdivision approach is used to compute the topology of the algebraic objects and to segment the...
ESA
2004
Springer
13 years 8 months ago
2004
Springer
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
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...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...