A subdivision arrangement algorithm for semi-algebraic curves: an overview - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

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

(1) , (1)
1
Julien Wintz
  • Function : Author
  • PersonId : 844680
Bernard Mourrain

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.
Fichier principal
Vignette du fichier
wintz-ArrangementSemiAlgebraicCurves.pdf (330.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00189560 , version 1 (21-11-2007)

Identifiers

Cite

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⟩
194 View
337 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More