Skip to Main content Skip to Navigation
Conference papers

A subdivision arrangement algorithm for semi-algebraic curves: an overview

Julien Wintz 1 Bernard Mourrain 1
1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis (... - 2019), CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Julien Wintz Connect in order to contact the contributor
Submitted on : Wednesday, November 21, 2007 - 1:14:22 PM
Last modification on : Thursday, January 20, 2022 - 4:13:36 PM
Long-term archiving on: : Monday, April 12, 2010 - 3:04:27 AM


Files produced by the author(s)




Julien Wintz, Bernard Mourrain. A subdivision arrangement algorithm for semi-algebraic curves: an overview. 15th Pacific Conference on Computer Graphics and Applications, Ron Goldman, Oct 2007, Lahaina, Maui, Hawaii, United States. pp.449-452, ⟨10.1109/ISBN0-7695-3009-5⟩. ⟨inria-00189560⟩



Les métriques sont temporairement indisponibles