Delaunay triangulations with disconnected realization spaces
DOI10.1145/2582112.2582119zbMATH Open1395.68314OpenAlexW2024281458MaRDI QIDQ4635539FDOQ4635539
Authors: Arnau Padrol, Louis Theran
Publication date: 23 April 2018
Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2582112.2582119
Recommendations
- Realizability of Delaunay triangulations
- Universality theorems for inscribed polytopes and Delaunay triangulations
- Simpler proof of a realizability theorem on Delaunay triangulations
- Nice point sets can have nasty Delaunay triangulations
- Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
Delaunay triangulationoriented matroidinscribed polytopeuniversality theoremrealization spaceisotopy problem
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Computational aspects related to convexity (52B55) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (7)
- Neighborly inscribed polytopes and Delaunay triangulations
- Realizability of Delaunay triangulations
- Simpler proof of a realizability theorem on Delaunay triangulations
- The deformation space of Delaunay triangulations of the sphere
- Realization spaces of arrangements of convex bodies
- Dushnik-Miller dimension of TD-Delaunay complexes
- Universality theorems for inscribed polytopes and Delaunay triangulations
This page was built for publication: Delaunay triangulations with disconnected realization spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635539)