Advanced programming techniques applied to CGAL's arrangement package
From MaRDI portal
Publication:2371336
DOI10.1016/j.comgeo.2006.11.007zbMath1114.65312MaRDI QIDQ2371336
Dan Halperin, Efi Fogel, Ron Wein, Baruch Zukerman
Publication date: 4 July 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.11.007
arrangements; robustness; computational geometry; software package; exact computation; generic programming; design patterns; CGAL; Computational Geometry Algorithms Library
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
65Y15: Packaged methods for numerical algorithms
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient and exact manipulation of algebraic points and curves
- The visibility-Voronoi complex and its applications
- Using generic programming for designing a data structure for polyhedral surfaces
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
- A fast planar partition algorithm. I
- Algorithms for Reporting and Counting Geometric Intersections
- INNER-COVER OF NON-CONVEX SHAPES
- Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
- Triangulations in CGAL (extended abstract)
- Complete, exact, and efficient computations with cubic curves
- Towards and open curved kernel
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
- Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
- The design and implementation of panar maps in CGAL
- Algorithms – ESA 2004
- Algorithms – ESA 2004
- Algorithms – ESA 2005
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Polygon decomposition for efficient construction of Minkowski sums
