DOAJ Open Access 2014

Many neighborly inscribed polytopes and Delaunay triangulations

Bernd Gonska Arnau Padrol

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (2)

Bernd Gonska

Arnau Padrol

Format Sitasi

APA MLA BibTeX

Gonska, B., Padrol, A. (2014). Many neighborly inscribed polytopes and Delaunay triangulations. https://doi.org/10.46298/dmtcs.2389

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2389

Informasi Jurnal

Tahun Terbit: 2014
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.2389
Akses: Open Access ✓