Advanced programming techniques applied to CGAL's arrangement package

DOI10.1016/j.comgeo.2006.11.007zbMath1114.65312OpenAlexW2076643072MaRDI QIDQ2371336

Ron Wein, Efi Fogel, Dan Halperin, 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

zbMATH Keywords

arrangementsrobustnesscomputational geometrysoftware packageexact computationgeneric programmingdesign patternsCGALComputational Geometry Algorithms Library

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packaged methods for numerical algorithms (65Y15)

Related Items

The visibility-Voronoi complex and its applications ⋮ A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces ⋮ Arrangements on parametric surfaces. I: General framework and infrastructure ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation ⋮ Computing the arrangement of circles on a sphere, with applications in structural biology ⋮ An efficient algorithm for the stratification and triangulation of an algebraic surface

Uses Software

• CGAL
• LEDA
• EXACUS
• MAPC
• Boost
• 2D Arrangement
• 2D triangulations
• STL
• Traits
• ESOLID
• BGL

Cites Work

• 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
• On the design of CGAL a computational geometry algorithms library
• 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