36 search results - page 4 / 8 » Topology and arrangement computation of semi-algebraic plana... |
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has b...
SMA
2008
ACM
13 years 7 months ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
CAD
2008
Springer
13 years 7 months ago
2008
Springer
By simultaneously considering evolution processes for parametric spline curves and implicitly defined curves, we formulate the framework of dual evolution. This allows us to combin...
SODA
2008
ACM
13 years 9 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...