Abstract

2D-representations of 3D digital objects find versatile applications to computer vision, robotics, medical imaging, and in discrete geometry. This work presents an algorithm for constructing a planar embedding with only straight-line edges for a general non-intersecting orthogonal polyhedron that has genus 0. We discover certain characterizations of vertices and edges of a polyhedron that lead to efficient graph-drawing on the 2D plane. The original orthogonal polyhedron can be fully reconstructed from this graph provided the information regarding the coordinates of vertices, are preserved. The time complexity of the proposed embedding is linear in the number of edges of the orthogonal polyhedron.

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.