Abstract
2D and 2.5D triangulations belong nowadays among the most often types of geometric object description in computer graphics. a frequent application is, e.g., terrain modeling. Therefore the problem of fast visualization of this type of data is often solved. One possible approach is the reduction of data duplicities by using triangle strips.This paper describes a new stripification algorithm for models, based on Delaunay triangulation using incremental insertion algorithm with DAG. As far as we know, this is the first algorithm which is able to create triangle strips within construction of triangulation and so enables continuous visualization of the models.
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.
