Abstract

This paper presents a fast visible surface algorithm for free form bodies. Conventional algorithms for such objects require a lot of computing time as well as much memory capacity. The proposed algorithm approximates the objects with many small triangles. It makes use of a special triangle data structure which preserves topological information between neighboring triangles and requires comparatively small memory storage. By employing the segment chain method, the algorithm exhibits much faster characteristics compared with the Watkins' algorithm.

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.