A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview

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 co...

Full description

Saved in:
Bibliographic Details
Main Authors: Wintz, J., Mourrain, B.
Format: Conference Proceeding
Language:English
Subjects:
Application software
Arithmetic
Computer applications
Computer graphics
Data structures
Equations
Piecewise linear approximation
Piecewise linear techniques
Polynomials
Topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1550-4085
DOI:10.1109/PG.2007.18