Open Access
Yet another method for triangulation and contouring for automated cartography
Reads0
Chats0
TLDR
An algorithm is presented for hierarchical subdivision of a set of three-dimensional surface observations and the results obtained are compared with those given by Delaunay triangulation.Abstract:
An algorithm is presented for hierarchical subdivision of a set of three-dimensional surface observations. The data structure used for obtaining the desired triangulation is also singularly appropriate for extracting contours. Some examples are presented, and the results obtained are compared with those given by Delaunay triangulation. The data points selected by the algorithm provide a better approximation to the desired surface than do randomly selected points.read more
Citations
More filters
Journal ArticleDOI
The Quadtree and Related Hierarchical Data Structures
TL;DR: L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques and the robotique.
Journal ArticleDOI
A hierarchical structure for surface approximation
TL;DR: Efficient algorithms for approximation of the elevation of an arbitrary point, contour extraction, and conversion of the hierarchical structure into an ordinary triangulated irregular network, are demonstrated.
Book ChapterDOI
Bibliography on quadtrees and related hierarchical data structures
TL;DR: This bibliography is an updated version of the one published in ACM Computing Surveys [214] and is based on data published in [214].
Related Papers (5)
Entire optimized triangulation algorithm of Delaunay triangle network for DEM construction
Luo Bin,M A Zhi-Min +1 more