A population analysis for hierarchical data structures
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Storing a collection of polygons using quadtrees
ACM Transactions on Graphics (TOG)
An effective way to represent quadtrees
Communications of the ACM
Speeding up construction of PMR quadtree-based spatial indexes
The VLDB Journal — The International Journal on Very Large Data Bases
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
A Hierarchical Data Structure for Representing the Spatial Decomposition of 3-D Objects
IEEE Computer Graphics and Applications
The PR-star octree: a spatio-topological data structure for tetrahedral meshes
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Octree-based indexing for 3D pointclouds within an Oracle Spatial DBMS
Computers & Geosciences
A spatial approach to morphological feature extraction from irregularly sampled scalar fields
Proceedings of the Third ACM SIGSPATIAL International Workshop on GeoStreaming
Advances in Engineering Software
A primal/dual representation for discrete morse complexes on tetrahedral meshes
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
Hi-index | 0.00 |
We address the problem of performing spatial queries on tetrahedral meshes. These latter arise in several application domains including 3D GIS, scientific visualization, finite element analysis. We have defined and implemented a family of spatial indexes, that we call tetrahedral trees. Tetrahedral trees subdivide a cubic domain containing the mesh in an octree or 3D kd-tree fashion, with three different subdivision criteria. Here, we present and compare such indexes, their memory usage, and spatial queries on them.