On the design of CGAL a computational geometry algorithms library

DOI<1167::AID-SPE337>3.0.CO;2-B 10.1002/1097-024X(200009)30:11<1167::AID-SPE337>3.0.CO;2-BzbMath1147.68781OpenAlexW1982289281MaRDI QIDQ4789074

Geert-Jan Giezeman, Lutz Kettner, Sven Schönherr, Stefan Schirra, Andreas Fabri

Publication date: 23 January 2003

Full work available at URL: https://doi.org/10.1002/1097-024x(200009)30:11<1167::aid-spe337>3.0.co;2-b

zbMATH Keywords

C++computational geometrygeneric programmingsoftware library

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (26)

An adaptable and extensible geometry kernel ⋮ Advanced programming techniques applied to CGAL's arrangement package ⋮ Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments ⋮ Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing ⋮ Geometrically nonlinear design of compliant mechanisms: topology and shape optimization with stress and curvature constraints ⋮ An adaptive rectangular mesh administration and refinement technique with application in cancer invasion models ⋮ FastJet user manual (for version 3.0.2) ⋮ Programming with C++ concepts ⋮ An object‐oriented geometric engine design for discontinuities in unfitted/immersed/enriched finite element methods ⋮ A dual mortar embedded mesh method for internal interface problems with strong discontinuities ⋮ Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\) ⋮ Arrangements on parametric surfaces. I: General framework and infrastructure ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ A Numerical Domain Decomposition Method for Solving Elliptic Equations on Manifolds ⋮ Classroom examples of robustness problems in geometric computations ⋮ AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE ⋮ Introducing VAUCANSON ⋮ CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ Polygon decomposition for efficient construction of Minkowski sums ⋮ Robust Construction of the Additively-Weighted Voronoi Diagram via Topology-Oriented Incremental Algorithm ⋮ CGAL ⋮ Enhanced optimal Delaunay triangulation methods with connectivity regularization ⋮ Reporting intersections among thick objects. ⋮ Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks ⋮ Fast methods for computing centroidal Voronoi tessellations

Uses Software

• LEDA
• GeoBench
• STL
• PlaGeo
• SpaGeo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Checking geometric programs or verification of geometric structures
• Using generic programming for designing a data structure for polyhedral surfaces
• A workbench for computational geometry
• Literate Programming

This page was built for publication: On the design of CGAL a computational geometry algorithms library