Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension

DOI10.1145/1542362.1542403zbMath1380.68382OpenAlexW2071569218MaRDI QIDQ5370719

Olivier Devillers, Jean-Daniel Boissonnat, Samuel Hornus

Publication date: 20 October 2017

Published in: Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1542362.1542403

zbMATH Keywords

Delaunay triangulationDelaunay graph

Mathematics Subject Classification ID

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

Related Items (15)

A Penalized Synthetic Control Estimator for Disaggregated Data ⋮ Faster geometric algorithms via dynamic determinant computation ⋮ Simplex-stochastic collocation method with improved scalability ⋮ An evaluation of point-insertion sequences for incremental Delaunay tessellations ⋮ PSI: constructing ad-hoc simplices to interpolate high-dimensional unstructured data ⋮ Efficient edge-skeleton computation for polytopes defined by oracles ⋮ Unnamed Item ⋮ Parallel geometric algorithms for multi-core computers ⋮ Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ Randomized incremental construction of Delaunay triangulations of nice point sets ⋮ The Implementation of the Colored Abstract Simplicial Complex and Its Application to Mesh Generation ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints ⋮ Unnamed Item ⋮ TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

This page was built for publication: Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension