Paper Info
Title
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Abstract
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangements of curves in the plane is a basic problem in computational geometry. Applications relying on arrangements arise in fields such as robotics, computer vision and computer graphics. Many algorithms for constructing and main taining arrangements under various conditions have been published in papers. However, there are not many implementations of (general) arrangements packages available. We present an implementation of a generic and robust package for arrangements of curves that is part of the CGAL1 library. We also present an application basedon this package for adaptive point location in arrangements of parametric curves.
Year
DOI
Venue
2000
10.1007/3-540-44691-5_15
Algorithm Engineering
Keywords
Field
DocType
adaptive point location,two-dimensional arrangements,computer vision,basic problem,c. constructing arrangement,robust package,parametric curves,application basedon,cgal1 library,collection c,arrangements package,computer graphics,parametric curve,computational geometry,point location
Parametric surface,Discrete mathematics,Parametric equation,Point location,Computer graphics (images),Vertex (geometry),Computer science,Computational geometry,Algorithm,Bézier curve,Subdivision,Computer graphics
Conference
ISBN
Citations 
PageRank 
3-540-42512-8
8
0.78
References 
Authors
9
2
Name
Order
Citations
PageRank
Iddo Hanniel119712.98
Dan Halperin21291105.20