scientific article; zbMATH DE number 6928867

MaRDI QIDQ4584097zbMATHFDO

Authors Bernd Gonska, Arnau Padrol

Publication date 29 August 2018

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAT0115

zbMATH Keywords

Delaunay triangulationnumber of combinatorial typesneighborly polytopeinscribable polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55)

Recommendations

• Neighborly inscribed polytopes and Delaunay triangulations
• Many neighborly polytopes and oriented matroids
• Universality theorems for inscribed polytopes and Delaunay triangulations
• On the number of higher order Delaunay triangulations
• On the Number of Higher Order Delaunay Triangulations
• Neighborly polytopes and oriented matroids
• Almost regular Delaunay-triangulations
• On inscribed and circumscribed convex polyhedra
• On weakly-neighbourly polyhedra
• Neighbourly polytopes with few vertices

Cited in

(2)

• Many regular triangulations and many polytopes
• Neighborly inscribed polytopes and Delaunay triangulations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584097)