Convex hulls of piecewise-smooth Jordan curves
Journal of Algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Efficient algorithms for line and curve segment intersection using restricted predicates
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Look — a Lazy Object-Oriented Kernel for geometric computation
Proceedings of the sixteenth annual symposium on Computational geometry
Reporting curve segment intersections using restricted predicates
Computational Geometry: Theory and Applications
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
ESOLID---A System for Exact Boundary Evaluation
Proceedings of the seventh ACM symposium on Solid modeling and applications
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
The Design and Implementation of Planar Maps in CGAL
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
A Separation Bound for Real Algebraic Expressions
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
High-Level Filtering for Arrangements of Conic Arcs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Polynomial real root isolation using Descarte's rule of signs
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
MAPC: A library for Efficient and Exact Manipulation of Algebraic Points and Curves
MAPC: A library for Efficient and Exact Manipulation of Algebraic Points and Curves
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Controlled perturbation for arrangements of circles
Proceedings of the nineteenth annual symposium on Computational geometry
The reliable algorithmic software challenge RASC
Computer Science in Perspective
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Complete, exact, and efficient computations with cubic curves
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Towards and open curved kernel
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The predicates of the Apollonius diagram: algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Complete subdivision algorithms, I: intersection of Bezier curves
Proceedings of the twenty-second annual symposium on Computational geometry
An approximate arrangement algorithm for semi-algebraic curves
Proceedings of the twenty-second annual symposium on Computational geometry
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Interference-constrained wireless coverage in a protocol model
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Exact and approximate construction of offset polygons
Computer-Aided Design
Advanced programming techniques applied to Cgal's arrangement package
Computational Geometry: Theory and Applications
Exact and efficient 2D-arrangements of arbitrary algebraic curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improving the topology computation of an arrangement of cubics
Computational Geometry: Theory and Applications
The predicates of the Apollonius diagram: Algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
The reliable algorithmic software challenge RASC
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Computing the topology of an arrangement of quartics
Proceedings of the 12th IMA international conference on Mathematics of surfaces XII
Journal of Symbolic Computation
A generic algebraic kernel for non-linear geometric applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Exact medial axis computation for circular arc boundaries
Proceedings of the 7th international conference on Curves and Surfaces
| Hi-index | 0.00 |
We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately leads to a realization of regularized boolean operations on conic polygons. A conic polygon, or polygon for short, is anything that can be obtained from linear or conic halfspaces (= the set of points where a linear or quadratic function is non-negative) by regularized boolean operations. The algorithm and its implementation are complete (they can handle all cases), exact (they give the mathematically correct result), and efficient (they can handle inputs with several hundred primitives).