Delaunay triangulations of point sets in closed euclidean d-manifolds
DOI10.1145/1998196.1998236zbMath1283.68350OpenAlexW2035934782MaRDI QIDQ5404433
Monique Teillaud, Manuel Caroli
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
orbit spacecovering spacecrystallographic groupsincremental algorithmdelaunay triangulationclosed euclidean manifolds
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Discrete geometry (52C99)
Related Items (2)
This page was built for publication: Delaunay triangulations of point sets in closed euclidean d-manifolds