Interval arithmetic yields efficient dynamic filters for computational geometry
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
High-Level Filtering for Arrangements of Conic Arcs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization)
Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization)
An exact, complete and efficient computation of arrangements of Bézier curves
Proceedings of the 2007 ACM symposium on Solid and physical modeling
A package for exact kinetic data structures and sweepline algorithms
Computational Geometry: Theory and Applications
Classroom examples of robustness problems in geometric computations
Computational Geometry: Theory and Applications
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere
Computational Geometry: Theory and Applications
Univariate Algebraic Kernel and Application to Arrangements
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
The predicates of the Apollonius diagram: Algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We summarize recent progress and on-going developments for exact geometric and algebraic computations within the Computational Geometry Algorithms Library (Cgal). We detail the existing machinery used in efficient, exact and robust implementations of various geometric entities.