Triangulations in CGAL

DOI10.1016/S0925-7721(01)00054-2zbMath1016.68138OpenAlexW1971748934MaRDI QIDQ1602941

Monique Teillaud, Olivier Devillers, Sylvain Pion, Mariette Yvinec, Jean-Daniel Boissonnat

Publication date: 24 June 2002

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00054-2

zbMATH Keywords

triangulationsDelaunay triangulationcomputational geometry algorithms library

Mathematics Subject Classification ID

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

Related Items (16)

CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS ⋮ Partial optimal transport for a constant-volume Lagrangian mesh with free boundaries ⋮ Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL ⋮ FastJet user manual (for version 3.0.2) ⋮ Multithread parallelization of LEPP-bisection algorithms ⋮ Topological mesh operators ⋮ Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation ⋮ Selecting radiotherapy dose distributions by means of constrained optimization problems ⋮ Variational surface reconstruction based on Delaunay triangulation and graph cut ⋮ Succinct representations of planar maps ⋮ Generalised primal-dual grids for unstructured co-volume schemes ⋮ COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS ⋮ Parallel geometric algorithms for multi-core computers ⋮ The Voronoi diagram of three lines ⋮ Enforcing the non-negativity constraint and maximum principles for diffusion with decay on general computational grids ⋮ 2-manifold tests for 3D Delaunay triangulation-based surface reconstruction

Uses Software

• CGAL
• gmp
• Qhull
• Triangle
• 3D triangulations
• 2D triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound for conforming Delaunay triangulations
• Voronoi diagrams and arrangements
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• Checking the convexity of polytopes and the planarity of subdivisions
• Using generic programming for designing a data structure for polyhedral surfaces
• Representing geometric structures in \(d\) dimensions: Topology and order
• THE DELAUNAY HIERARCHY
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
• The quickhull algorithm for convex hulls
• Walking in a triangulation

This page was built for publication: Triangulations in CGAL