The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Towards an analysis of range query performance in spatial data structures
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Smooth view-dependent level-of-detail control and its application to terrain rendering
Proceedings of the conference on Visualization '98
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Visualization of large terrains made easy
Proceedings of the conference on Visualization '01
Walking Through a Very Large Virtual Environment in Real-time
Proceedings of the 27th International Conference on Very Large Data Bases
Database Support for Spatial Generalisation for WWW and Mobile Applications
WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
Data Structures for Simplicial Multi-complexes
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Compressing Multiresolution Triangle Meshes
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Database support for multiresolution terrain visualization
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
I/O Complexity for Range Queries on Region Data Stored Using an R-tree
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Analyzing Range Queries on Spatial Data
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
A Multiresolution Terrain Model for Efficient Visualization Query Processing
IEEE Transactions on Knowledge and Data Engineering
A multi-resolution surface distance model for k-NN query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing land surface for efficient kNN query
Proceedings of the VLDB Endowment
A motion-aware approach for efficient evaluation of continuous queries on 3D object databases
The VLDB Journal — The International Journal on Very Large Data Bases
Multiresolution query optimization in an online environment
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Data centric research at the University of Queensland
ACM SIGMOD Record
| Hi-index | 0.00 |
Terrain can be approximated by a triangular mesh consistingmillions of 3D points. Multiresolution triangularmesh (MTM) structures are designed to support applicationsthat use terrain data at variable levels of detail (LOD).Typically, an MTM adopts a tree structure where a parentnode represents a lower-resolution approximation of its descendants.Given a region of interest (ROI) and a LOD,the process of retrieving the required terrain data from thedatabase is to traverse the MTM tree from the root to reachall the nodes satisfying the ROI and LOD conditions. Thisprocess, while being commonly used for multiresolution terrainvisualization, is inefficient as either a large numberof sequential I/O operations or fetching a large amount ofextraneous data is incurred. Various spatial indexes havebeen proposed in the past to address this problem, howeverlevel-by-level tree traversal remains a common practice inorder to obtain topological information among the retrievedterrain data. In this paper, a new MTM data structure calleddirect mesh is proposed. We demonstrate that with directmesh the amount of data retrieval can be substantially reduced.Comparing with existing MTM indexing methods,a significant performance improvement has been observedfor real-life terrain data.