36 search results - page 2 / 8 » Topology and arrangement computation of semi-algebraic plana... |
COMPGEOM
2004
ACM
13 years 8 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
SMA
2008
ACM
13 years 5 months ago
2008
ACM
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
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...