Indexing the Sphere with the Hierarchical Triangular Mesh

Details Indexing the Sphere with the Hierarchical Triangular Mesh Indexing the Sphere with the Hierarchical Triangular Mesh

2007-01-26

arxiv.org/abs/cs/0701164v1

Computer Science

Databases

Scientific paper

We describe a method to subdivide the surface of a sphere into spherical triangles of similar, but not identical, shapes and sizes. The Hierarchical Triangular Mesh (HTM) is a quad-tree that is particularly good at supporting searches at different resolutions, from arc seconds to hemispheres. The subdivision scheme is universal, providing the basis for addressing and for fast lookups. The HTM provides the basis for an efficient geospatial indexing scheme in relational databases where the data have an inherent location on either the celestial sphere or the Earth. The HTM index is superior to cartographical methods using coordinates with singularities at the poles. We also describe a way to specify surface regions that efficiently represent spherical query areas. This article presents the algorithms used to identify the HTM triangles covering such regions.

Affiliated with

Also associated with

No associations

Rating

Indexing the Sphere with the Hierarchical Triangular Mesh does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Indexing the Sphere with the Hierarchical Triangular Mesh, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Indexing the Sphere with the Hierarchical Triangular Mesh will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568205