Hierarchical triangulation for multiresolution surface description
ACM Transactions on Graphics (TOG)
Real-time, continuous level of detail rendering of height fields
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
ROAMing terrain: real-time optimally adapting meshes
VIS '97 Proceedings of the 8th conference on Visualization '97
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Smooth view-dependent level-of-detail control and its application to terrain rendering
Proceedings of the conference on Visualization '98
Visualization of large terrains made easy
Proceedings of the conference on Visualization '01
Fast view-dependent level-of-detail rendering using cached geometry
Proceedings of the conference on Visualization '02
A Pyramidal Data Structure for Triangle-Based Surface Description
IEEE Computer Graphics and Applications
Variable Resolution Terrain Surfaces
Proceedings of the 8th Canadian Conference on Computational Geometry
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Streaming-Data Algorithms for High-Quality Clustering
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Multi-resolution out-of-core modeling of terrain and teological data
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
| Hi-index | 0.00 |
This paper presents a novel approach to handle large amounts of geometric data. A data stream clustering is used to reduce the amount of data and build a hierarchy of clusters. The data stream concept allows for the processing of very large data sets. The cluster hierarchy is then used in a dynamic triangulation to create a multiresolution model. It allows for the interactive selection of a different level of detail in various parts of the data. A method for removal multiple points from Delaunay triangulation is proposed. It is significantly faster than the traditional approach. The clustering and the triangulation are supplemented by an elliptical metric to handle data with anisotropic properties. Compared to the closest competitive method by Isenburg et al., the presented algorithm requires only a single pass over the data and offers a high flexibility. These advantages culminate in a long running time. The method was tested on several large digital elevation maps. The clustering phase can take up to a few hours. Once the cluster hierarchy is built, the terrains can be efficiently manipulated in real time.