论文信息 - Cauchy's Theorem for Orthogonal Polyhedra of Genus 0

Cauchy's Theorem for Orthogonal Polyhedra of Genus 0

A famous theorem by Cauchy states that the dihedral angles of a convex polyhedron are determined by the incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhedra of genus 0 as long as no face has a hole. Our proof yields a linear-time algorithm to find the dihedral angles.

Therese C. Biedl | Burkay Genç | T. Biedl | Burkay Genç

[1] R. Connelly,et al. The Bellows conjecture. , 1997 .

[2] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[3] Therese C. Biedl,et al. Cauchy's Theorem and Edge Lengths of Convex Polyhedra , 2007, WADS.

[4] Peter Eades,et al. The Logic Engine and the Realization Problem for Nearest Neighbor Graphs , 1996, Theor. Comput. Sci..

[5] Therese C. Biedl,et al. When can a net fold to a polyhedron , 2005, CCCG.

[6] Joseph O'Rourke,et al. Unfolding Manhattan Towers , 2005, CCCG.

[7] Joseph O'Rourke,et al. Epsilon-Unfolding Orthogonal Polyhedra , 2007, Graphs Comb..

[8] Joseph O'Rourke,et al. Nonorthogonal polyhedra built from rectangles , 2002, CCCG.

[9] Martin Aigner,et al. Proofs from THE BOOK , 1998 .

[10] Joseph O'Rourke. Computational geometry column 51 , 2008, SIGA.

[11] A. Bobenko,et al. ALEXANDROV'S THEOREM, WEIGHTED DELAUNAY TRIANGULATIONS, AND MIXED VOLUMES , 2006, math/0609447.

[12] I. Pak,et al. Rigidity and polynomial invariants of convex polytopes , 2005 .

[13] N. Dolbilin,et al. Rigidity of a quadrillage of the torus , 1999 .

[14] Joseph O'Rourke. Computational geometry column 49 , 2007, SIGA.

[15] Therese C. Biedl,et al. When can a graph form an orthogonal polyhedron? , 2004, CCCG.

[16] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.

[17] Burkay Genç,et al. Reconstruction of Orthogonal Polyhedra , 2008 .