Sciweavers

DCG
2008
64views more  DCG 2008»
13 years 11 months ago
Grid Vertex-Unfolding Orthogonal Polyhedra
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows addition...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
DCG
2008
70views more  DCG 2008»
13 years 11 months ago
Decomposability of Polytopes
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
Krzysztof Przeslawski, David Yost
DCG
2008
71views more  DCG 2008»
13 years 11 months ago
Generating All Vertices of a Polyhedron Is Hard
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
DCG
2008
93views more  DCG 2008»
13 years 11 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak