Cauchy’s Theorem and Edge Lengths of Convex Polyhedra
From MaRDI portal
Publication:3603544
DOI10.1007/978-3-540-73951-7_35zbMATH Open1209.68579OpenAlexW1563247514MaRDI QIDQ3603544FDOQ3603544
Therese Biedl, Michael J. Spriggs, Anna Lubiw
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_35
Recommendations
- On the total length of edges of a polyhedral unit ball
- scientific article; zbMATH DE number 3913153
- scientific article
- scientific article; zbMATH DE number 5875567
- A converse of Euler's theorem for polyhedra
- On the edge metric dimension of convex polytopes and its related graphs
- On the metric dimension of convex polytopes
- An inequality on the edge lengths of triangular meshes
- scientific article; zbMATH DE number 3918098
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cited In (10)
- Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0
- Convex normality of rational polytopes with long edges
- The rigidity theorem and the deltahedra
- Title not available (Why is that?)
- On polyhedra with calculable diagonals
- An exposition of Poincaré's polyhedron theorem
- Calculation of polyhedra.
- A Pseudopolynomial Algorithm for Alexandrov’s Theorem
- P.L.-spheres, convex polytopes, and stress
- Title not available (Why is that?)
This page was built for publication: Cauchy’s Theorem and Edge Lengths of Convex Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603544)