On the design of CGAL a computational geometry algorithms library
From MaRDI portal
Publication:4789074
Recommendations
Cites work
- scientific article; zbMATH DE number 1182945 (Why is no real title available?)
- scientific article; zbMATH DE number 176581 (Why is no real title available?)
- scientific article; zbMATH DE number 1003230 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 1424302 (Why is no real title available?)
- A workbench for computational geometry
- Checking geometric programs or verification of geometric structures
- Literate Programming
- Using generic programming for designing a data structure for polyhedral surfaces
Cited in
(37)- Enhanced optimal Delaunay triangulation methods with connectivity regularization
- scientific article; zbMATH DE number 1848394 (Why is no real title available?)
- LOOK: A lazy object-oriented kernel design for geometric computation
- Robust construction of the additively-weighted Voronoi diagram via topology-oriented incremental algorithm
- GrAL- The Grid Algorithms Library
- Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing
- Arrangements on parametric surfaces. II: Concretizations and applications
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE
- 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\)
- Fast methods for computing centroidal Voronoi tessellations
- Polygon decomposition for efficient construction of Minkowski sums
- LEDA. A platform for combinatorial and geometric computing. 2-part set
- Algorithm 992
- Exact, efficient, and complete arrangement computation for cubic curves
- An object‐oriented geometric engine design for discontinuities in unfitted/immersed/enriched finite element methods
- An adaptable and extensible geometry kernel
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- Geometrically nonlinear design of compliant mechanisms: topology and shape optimization with stress and curvature constraints
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- CGAL
- CGAL -- reliable geometric computing for academia and industry
- Programming with C++ concepts
- Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
- A tutorial for designing flexible geometric algorithms
- Algorithms – ESA 2004
- The design and implementation of panar maps in CGAL
- Advanced programming techniques applied to CGAL's arrangement package
- An adaptive rectangular mesh administration and refinement technique with application in cancer invasion models
- Introducing VAUCANSON
- A Numerical Domain Decomposition Method for Solving Elliptic Equations on Manifolds
- FastJet user manual (for version 3.0.2)
- Reporting intersections among thick objects.
- CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
- Classroom examples of robustness problems in geometric computations
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
- Arrangements on parametric surfaces. I: General framework and infrastructure
This page was built for publication: On the design of CGAL a computational geometry algorithms library
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789074)
