Fast Delaunay stripification
Petr Vanečček, Ivana Kolingerová · 2003
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.