Biedl T.Genç, Burkay2023-06-162023-06-162009364204127297836420412730302-9743https://doi.org/10.1007/978-3-642-04128-0_7https://hdl.handle.net/20.500.14365/339817th Annual European Symposium on Algorithms, ESA 2009 -- 7 September 2009 through 9 September 2009 -- Copenhagen -- 77841A 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. © 2009 Springer Berlin Heidelberg.eninfo:eu-repo/semantics/openAccessConvex polyhedronsDihedral anglesLinear-time algorithmsClustering algorithmsRadar antennasConference Object10.1007/978-3-642-04128-0_72-s2.0-70350397057