About \(f\)-vectors of inscribed simplicial polytopes
From MaRDI portal
Publication:282733
DOI10.1007/s00454-016-9764-8zbMath1355.52006OpenAlexW2291439907MaRDI QIDQ282733
Publication date: 12 May 2016
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-016-9764-8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangulations. Structures for algorithms and applications
- Voronoi diagrams from convex hulls
- The number of faces of a simplicial convex polytope
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- A characterization of compact convex polyhedra in hyperbolic 3-space
- Graph-theoretical conditions for inscribability and Delaunay realizability
- A characterization of ideal polyhedra in hyperbolic 3-space
- On geometry of convex ideal polyhedra in hyperbolic 3-space
- The minimum number of vertices of a simple polytope
- A proof of the lower bound conjecture for convex polytopes
- Geometry and Topology for Mesh Generation
- Inscribable stacked polytopes
- Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
- Lectures on Polytopes
- Convex Polytopes
- A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA
- The maximum numbers of faces of a convex polytope
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
This page was built for publication: About \(f\)-vectors of inscribed simplicial polytopes
