19 search results - page 1 / 4 » Exact and efficient 2D-arrangements of arbitrary algebraic c... |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
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...
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...
COMPGEOM
2005
ACM
13 years 6 months ago
2005
ACM
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
ESA
2003
Springer
13 years 9 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...