Abstract
Abstract In a broad range of computer graphics applications, the representation of geometric shape is based on triangle meshes. General purpose data structures for polygonal meshes typically provide fast access to geometric objects (e.g., points) and topological entities (e.g., neighborhood relationships) but the memory requirements are rather high due to the many special configurations. In this paper, we present a new data structure which is specifically designed for triangle meshes. The data structure enables the programmer to trade memory for access time by either storing internal references explicitly, or by reconstructing them locally on demand. The trade-off can be hidden from the programmer by an object-oriented API and can automatically adapt to the available hardware resources or the complexity of the mesh (scalability).
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.
