INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, cilt.21, ss.383-391, 2011 (SCI İndekslerine Giren Dergi)
Stoker's theorem states that in a convex polyhedron, the dihedral angles and edge lengths determine the facial angles if the graph is fixed. In this paper, we study under what conditions Stoker's theorem holds for orthogonal polyhedra, obtaining uniqueness and a linear-time algorithm in some cases, and NP-hardness in others.