DCG 2008 | Sciweavers

11

DCG
2008

64views more DCG 2008»

Grid Vertex-Unfolding Orthogonal Polyhedra

13 years 4 months ago

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

claim paper

Read More »

9

click to vote

DCG
2008

70views more DCG 2008»

Decomposability of Polytopes

13 years 4 months ago

Download www.ballarat.edu.au

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

claim paper

Read More »

8

click to vote

DCG
2008

71views more DCG 2008»

Generating All Vertices of a Polyhedron Is Hard

13 years 4 months ago

Download dimacs.rutgers.edu

Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...

claim paper

Read More »

16

click to vote

DCG
2008

93views more DCG 2008»

Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings

13 years 4 months ago

Download www.math.umn.edu

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

claim paper

Read More »

6

click to vote

DCG
2008

52views more DCG 2008»

Shellable Complexes and Topology of Diagonal Arrangements

13 years 4 months ago

Download garsia.math.yorku.ca

Sangwook Kim

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers