Delaunay triangulations of point sets in closed Euclidean d-manifolds

DOI10.1145/1998196.1998236zbMATH Open1283.68350OpenAlexW2035934782MaRDI QIDQ5404433FDOQ5404433

Authors: Manuel Caroli, Monique Teillaud 

Publication date: 24 March 2014

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

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

Recommendations

• Delaunay triangulations of closed Euclidean \(d\)-orbifolds
• A weak characterisation of the Delaunay triangulation
• Delaunay triangulation of manifolds
• A generic Delaunay triangulation algorithm for finite element meshes
• Delaunay triangulations on orientable surfaces of low genus

zbMATH Keywords

orbit spacecrystallographic groupscovering spaceincremental algorithmdelaunay triangulationclosed euclidean manifolds

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete geometry (52C99)

Cited In (7)

• Computing 3D Periodic Triangulations
• Delaunay triangulations of closed Euclidean \(d\)-orbifolds
• Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
• Centroidal Voronoi tessellation in universal covering space of manifold surfaces
• Nice point sets can have nasty Delaunay triangulations
• Delaunay triangulation of manifolds
• The approximation of closed manifolds by triangulated manifolds and the triangulation of closed manifolds

This page was built for publication: Delaunay triangulations of point sets in closed Euclidean \(d\)-manifolds

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