2015/12/16 by Maria Hempel, Hempel, Maria
Arts and Humanities · Mathematics · Psychology · #Business #Computer science #Computer security #Economics #FOS: Mathematics #Flexibility (engineering) #Management #Metric Geometry (math.MG) #Philosophy and History of Science #Philosophy and Theoretical Science #math.MG
paper · pdf · doi:10.48550/arxiv.1512.05230
published in arXiv (Cornell University) (Cornell University) · This paper had been withdrawn by the author due an error in the Elimination Pattern Lemma, now modulo the lemma as a conjecture
openalex publication_date 2015/12/16 · arxiv created 2017/03/08 · arxiv updated 2017/03/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in ℝ3 up to similarity in terms of the angles of its faces and the angles between its faces. To do so we describe it as the set of its triangular faces glued together correspondingly and as the set of the polyhedral cones that it defines around its vertices. We recompute its dimension at smooth points modulo a combinatorial lemma.