The computational geometry algorithms library CGAL

DOI10.1145/2768577.2768579zbMATH Open1365.68441MaRDI QIDQ5268960FDOQ5268960

Efi Fogel, Monique Teillaud

Publication date: 22 June 2017

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00867884/file/SIGSAM-CCA_2013.pdf

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to computer science (68-04)

Cited In (29)

• A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
• An adaptable and extensible geometry kernel
• Surface reconstruction using umbrella filters
• Intersecting quadrics: an efficient and exact implementation
• Structural filtering: a paradigm for efficient and exact geometric programs
• A robust algorithm for geometric predicate by error-free determinant transformation
• Meshing skin surfaces with certified topology
• Simple floating-point filters for the two-dimensional orientation problem
• An applied point pattern matching problem: Comparing 2D patterns of protein spots
• Delaunay triangulations of closed Euclidean \(d\)-orbifolds
• The medial axis of the union of inner Voronoi balls in the plane
• Dynamical geometry for multiscale dissipative particle dynamics
• Selecting radiotherapy dose distributions by means of constrained optimization problems
• High-quality 2D mesh generation without obtuse and small angles
• Accurate surface reconstruction in 3D using two-dimensional parallel cross sections
• Delaunay meshing of piecewise smooth complexes without expensive predicates
• Computation of the metric average of 2D sets with piecewise linear boundaries
• On the degree of standard geometric predicates for line transversals in 3D
• A simple linear algorithm for computing rectilinear 3-centers
• Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
• Algorithm 992
• A Petri net based approach for multi-robot path planning
• A Three-Dimensional Conservative Coupling Method Between an Inviscid Compressible Flow and a Moving Rigid Solid
• Computing the conjugate of convex piecewise linear-quadratic bivariate functions
• An exact algorithm for the minimum dilation triangulation problem
• The design of the Boost interval arithmetic library
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• Divide-and-conquer for Voronoi diagrams revisited
• Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions

Uses Software

• CGAL

This page was built for publication: The computational geometry algorithms library CGAL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268960)