STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA

DOI10.1142/S0218195911003718zbMath1241.68122OpenAlexW2042411230MaRDI QIDQ2893454

Burkay Genç, Therese C. Biedl

Publication date: 20 June 2012

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195911003718

zbMATH Keywords

algorithmscombinatorial problemscomputational geometrytheory of computation

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial complexity of geometric structures (52C45)

Cites Work

• When can a net fold to a polyhedron?
• Unnamed Item

This page was built for publication: STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA