The computational geometry algorithms library CGAL
From MaRDI portal
Publication:5268960
DOI10.1145/2768577.2768579zbMath1365.68441MaRDI QIDQ5268960
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items (28)
Simple floating-point filters for the two-dimensional orientation problem ⋮ An adaptable and extensible geometry kernel ⋮ Delaunay triangulations of closed Euclidean \(d\)-orbifolds ⋮ A Three-Dimensional Conservative Coupling Method Between an Inviscid Compressible Flow and a Moving Rigid Solid ⋮ A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs ⋮ Computing the conjugate of convex piecewise linear-quadratic bivariate functions ⋮ Meshing skin surfaces with certified topology ⋮ Delaunay meshing of piecewise smooth complexes without expensive predicates ⋮ Computation of the metric average of 2D sets with piecewise linear boundaries ⋮ An exact algorithm for the minimum dilation triangulation problem ⋮ Accurate surface reconstruction in 3D using two-dimensional parallel cross sections ⋮ Efficient mesh optimization schemes based on optimal Delaunay triangulations ⋮ The medial axis of the union of inner Voronoi balls in the plane ⋮ Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case ⋮ Selecting radiotherapy dose distributions by means of constrained optimization problems ⋮ Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions ⋮ A Petri net based approach for multi-robot path planning ⋮ High-quality 2D mesh generation without obtuse and small angles ⋮ A simple linear algorithm for computing rectilinear 3-centers ⋮ Structural filtering: a paradigm for efficient and exact geometric programs ⋮ Dynamical geometry for multiscale dissipative particle dynamics ⋮ A robust algorithm for geometric predicate by error-free determinant transformation ⋮ Divide-and-conquer for Voronoi diagrams revisited ⋮ Intersecting quadrics: an efficient and exact implementation ⋮ Surface reconstruction using umbrella filters ⋮ On the degree of standard geometric predicates for line transversals in 3D ⋮ An applied point pattern matching problem: Comparing 2D patterns of protein spots ⋮ The design of the Boost interval arithmetic library
Uses Software
This page was built for publication: The computational geometry algorithms library CGAL
