Abstract

In this paper we characterize the set of orthogonal polyhedra in R3 that minimize the sum of their internal solid angles. To prove our result, we first generalize the well known result that any orthogonal polygon in the plane with n vertices has (n+4)/2 convex and (n−4)/2 reflex vertices; see [1,2]. We prove that an orthogonal polyhedron of genus g with n vertices, k of which have degree greater than or equal to 4, has (n+8−8g+3k)/2 convex vertices and (n−8+8g−3k)/2 reflex vertices. We also prove that the sum of the solid angles of an orthogonal polyhedron is at least (n−4+4g)π, and at most (3n−24−4g)π. These inequalities are minimized and maximized, respectively, when g=0.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.