Title
An exact, complete and efficient computation of arrangements of Bézier curves
Abstract
Arrangements of planar curves are fundamental structures in computational geometry. The arrangement package of CGAL can construct and maintain arrangements of various families of curves, when provided with the representation of the curves and some basic geometric functionality on them. It employs the exact computation paradigm in order to handle all degenerate cases in a robust manner. We present the representations and algorithms that are needed for implementing arrangements of Bézier curves using exact arithmetic. The implementation is efficient and complete, handling all degenerate cases. In order to avoid the prohibitive running times incurred by an indiscriminate usage of exact arithmetic, we make extensive use of the geometric properties of Bézier curves for filtering. As a result, most operations are carried out using fast approximate methods, and only in degenerate (or near-degenerate) cases do we resort to the exact, and more computationally demanding, procedures. To the best of our knowledge this is the first complete implementation that can construct arrangements of Bézier curves of any degree, and handle all degenerate cases in a robust manner.
Year
DOI
Venue
2007
10.1109/TASE.2009.2014734
IEEE Transactions on Automation Science and Engineering
Keywords
Field
DocType
computational geometry,exact arithmetic,arrangement package,exact computation paradigm,robust manner,approximate method,zier curve,complete implementation,basic geometric functionality,efficient computation,geometric property,curve fitting,bezier curve,robustness,bezier curves
B-spline,Mathematical optimization,Solid geometry,Polynomial interpolation,Computer science,Computational geometry,Robustness (computer science),Bézier curve,Non-uniform rational B-spline,Computation
Conference
Volume
Issue
ISSN
6
3
1545-5955
Citations 
PageRank 
References 
9
0.57
20
Authors
2
Name
Order
Citations
PageRank
Iddo Hanniel119712.98
Ron Wein223814.05