Abstract
The polygon mesh is an important primitive used in representing 3D models. Its specification consists of topological and geometrical quantities; where the former describes the connection nodes, edges and faces, and the latter describes attributes such as node positions, face colors, etc. Our interest here lies with the encoding of the topology. Specifically, this paper presents a linear-time information-theoretically optimal compression algorithm for encoding a planar 2-manifold polygon mesh to a bit string X.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
