Indexing the Sphere with the Hierarchical Triangular Mesh

Abstract

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.

References in corpus (1)

• There Goes the Neighborhood: Relational Algebra for Spatial Data Search

Cited by in corpus (9)

• The Zones Algorithm for Finding Points-Near-a-Point or Cross-Matching Spatial Datasets
• ANTARES: Progress towards building a `Broker' of time-domain alerts
• Spatial Language Representation with Multi-Level Geocoding
• Using Table Valued Functions in SQL Server 2005 To Implement a Spatial Data Library
• Herschel Mission Planning Software
• The LOFAR Transients Pipeline
• Faint, high proper motion star candidates selected from the SDSS and PS1 catalogs
• Cross-matching Engine for Incremental Photometric Sky Survey
• The Taiwan Extragalactic Astronomical Data Center