Indexing the Sphere with the Hierarchical Triangular Mesh
<|reference_start|>Indexing the Sphere with the Hierarchical Triangular Mesh: 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.<|reference_end|>
@article{szalay2007indexing,
    title={Indexing the Sphere with the Hierarchical Triangular Mesh},
    author={Alexander S. Szalay, Jim Gray, George Fekete, Peter Z. Kunszt, Peter
  Kukol, Ani Thakar},
    journal={arXiv preprint arXiv:cs/0701164},
    year={2007},
    number={MSR-TR-2005-123},
    archivePrefix={arXiv},
    eprint={cs/0701164},
    primaryClass={cs.DB cs.DS}
}