loading...
A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview
Maui, Hawaii October 29-November 02
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PG.2007.1815th Pacific Conference on Computer G ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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 boundary of regions defined by these objects. An efficient insertion technique is described, which detects regions in conflict and updates the underlying arrangement structure. We describe the general framework of this method, the main region insertion operation and the specializations of the key ingredients for the different types of objects: implicit, parametric or piecewise linear curves.
Citation:
Julien Wintz, Bernard Mourrain, "A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview," pg, pp.449-452, 15th Pacific Conference on Computer Graphics and Applications (PG'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.