12 search results - page 1 / 3 » Exact, efficient, and complete arrangement computation for c... |
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...
COMGEO
2006
ACM
13 years 4 months ago
2006
ACM
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...
SMA
2008
ACM
13 years 4 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 4 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 ...