scientific article; zbMATH DE number 6928867

zbMATH Open1394.52013MaRDI QIDQ4584097FDOQ4584097

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

Title of this publication is not available (Why is that?)

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

• Title not available (Why is that?) 👍 👎
• Many neighborly polytopes and oriented matroids 👍 👎
• Neighborly inscribed polytopes and Delaunay triangulations 👍 👎
• Neighbourly polytopes with few vertices 👍 👎
• 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 👍 👎
• Almost regular Delaunay-triangulations 👍 👎
• On weakly-neighbourly polyhedra 👍 👎

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)