Skip to Main content Skip to Navigation
Conference papers

Many neighborly inscribed polytopes and Delaunay triangulations

Abstract : We present a very simple explicit technique to generate a large family of point configurations with neighborly Delaunay triangulations. This proves that there are superexponentially many combinatorially distinct neighborly $d$-polytopes with $n$ vertices that admit realizations inscribed on the sphere. These are the first examples of inscribable neighborly polytopes that are not cyclic polytopes, and provide the current best lower bound for the number of combinatorial types of inscribable polytopes (and thus also of Delaunay triangulations). It coincides with the current best lower bound for the number of combinatorial types of polytopes.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01207576
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, October 1, 2015 - 9:28:41 AM
Last modification on : Wednesday, February 27, 2019 - 11:08:02 AM
Long-term archiving on: : Saturday, January 2, 2016 - 10:41:31 AM

File

dmAT0115.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01207576, version 1

Collections

Citation

Bernd Gonska, Arnau Padrol. Many neighborly inscribed polytopes and Delaunay triangulations. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.161-168. ⟨hal-01207576⟩

Share

Metrics

Record views

137

Files downloads

633