Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
Algorithmic geometry
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)
Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)
Hyperbolic centroidal Voronoi tessellation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Alpha Shape Topology of the Cosmic Web
ISVD '10 Proceedings of the 2010 International Symposium on Voronoi Diagrams in Science and Engineering
Centroidal Voronoi tessellation in universal covering space of manifold surfaces
Computer Aided Geometric Design
Hyperbolic delaunay complexes and voronoi diagrams made practical
Proceedings of the twenty-ninth annual symposium on Computational geometry
Hi-index | 0.00 |
We give a definition of the Delaunay triangulation of a point set in a closed Euclidean d-manifold, i.e. a compact quotient space of the Euclidean space for a discrete group of isometries (a so-called Bieberbach group or crystallographic group). We describe a geometric criterion to check whether a partition of the manifold actually forms a triangulation (which subsumes that it is a simplicial complex). We provide an algorithm to compute the Delaunay triangulation of the manifold for a given set of input points, if it exists. Otherwise, the algorithm returns the Delaunay triangulation of a finitely-sheeted covering space of the manifold. The algorithm has optimal randomized worst-case time and space complexity. Whereas there was prior work for the special case of the flat torus, as far as we know this is the first result for general closed Euclidean d-manifolds. This research is motivated by application fields, like computational biology for instance, showing a need to perform simulations in quotient spaces of the Euclidean space by more general groups of isometries than the groups generated by d independent translations.