Neighborly inscribed polytopes and Delaunay triangulations
From MaRDI portal
Publication:1707359
DOI10.1515/advgeom-2015-0045zbMath1386.52009arXiv1308.5798OpenAlexW2605259482MaRDI QIDQ1707359
Publication date: 29 March 2018
Published in: Advances in Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.5798
Related Items
Scribability problems for polytopes ⋮ Many neighborly polytopes and oriented matroids ⋮ Realizability and inscribability for simplicial polytopes via nonlinear optimization ⋮ Universality theorems for inscribed polytopes and Delaunay triangulations ⋮ On three measures of non-convexity ⋮ Proper coloring of geometric hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Many neighborly polytopes and oriented matroids
- How to cage an egg
- Universality theorems for inscribed polytopes and Delaunay triangulations
- Triangulations. Structures for algorithms and applications
- Neighborly polytopes
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Cyclic polytopes and d-order curves
- Voronoi diagrams from convex hulls
- Nice point sets can have nasty Delaunay triangulations
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
- Combinatorics and commutative algebra.
- A characterization of ideal polyhedra in hyperbolic 3-space
- On Delaunay oriented matroids for convex distance functions
- Many projectively unique polytopes
- A centrally symmetric version of the cyclic polytope
- Inscribable stacked polytopes
- The number of polytopes, configurations and real matroids
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
- Convex Polytopes
- Delaunay triangulations with disconnected realization spaces
- Geometry and Topology for Mesh Generation
- The maximum numbers of faces of a convex polytope
