Fast Delaunay stripification

Authors:
Petr Vanečček;Ivana Kolingerová
Affiliations:
University of West Bohemia Pilsen, Czech Republic;University of West Bohemia Pilsen, Czech Republic
Venue:
SCCG '03 Proceedings of the 19th spring conference on Computer graphics
Year:
2003

Citing 3
Cited 1

A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time

SCG '86 Proceedings of the second annual symposium on Computational geometry
Randomized incremental construction of Delaunay and Voronoi diagrams

Proceedings of the seventeenth international colloquium on Automata, languages and programming
A comparison of sequential Delaunay triangulation algorithms

Proceedings of the eleventh annual symposium on Computational geometry

Technical Section: Comparison of triangle strips algorithms

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

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.