The design and analysis of spatial data structures
The design and analysis of spatial data structures
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Spherical wavelets: efficiently representing functions on the sphere
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Navigating through triangle meshes implemented as linear quadtrees
ACM Transactions on Graphics (TOG)
Data models, structures and access software for scientific visualization
VIS '93 Proceedings of the 4th conference on Visualization '93
Visualizing polycrystalline orientation microstructures with spherical color maps
VIS '94 Proceedings of the conference on Visualization '94
PNORMS: platonic derived normals for error bound compression
Proceedings of the ACM symposium on Virtual reality software and technology
Automatic segmentation of unorganized noisy point clouds based on the Gaussian map
Computer-Aided Design
Distributed gradient-domain processing of planar and spherical images
ACM Transactions on Graphics (TOG)
Metric-aware processing of spherical imagery
ACM SIGGRAPH Asia 2010 papers
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
SIAM Journal on Scientific Computing
A seamless visualizaton model of the global terrain based on the QTM
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
Spherical Q2-tree for sampling dynamic environment sequences
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
| Hi-index | 0.00 |
Most databases for spherically distributed data are not structured in a manner consistent with their geometry. As a result, such databases possess undesirable artifacts, including the introduction of "tears" in the data when they are mapped onto a flat file system. Furthermore, it is difficult to make queries about the topological relationship among the data components without performing real arithmetic. The sphere quadtree (SQT), which is based on the recursive subdivision of spherical triangles obtained by projecting the faces of an icosahedron onto a sphere, eliminates some of these problems. The SQT allows the representation of data at multiple levels and arbitrary resolution. Efficient search strategies can be implemented for the selection of data to be rendered or analyzed by a specific technique. Furthermore, sphere quadtrees offer significant potential for improving the accuracy and efficiency of spherical surface rendering algorithms as well as for spatial data management and geographic information systems. Most importantly, geometric and topological consistency with the data is maintained.