Indexing the Sphere with the Hierarchical Triangular Mesh

Simple item page
dc.creatorSzalay, Alexander S.
dc.creatorGray, Jim
dc.creatorFekete, George
dc.creatorKunszt, Peter Z.
dc.creatorKukol, Peter
dc.creatorThakar, Ani
dc.date2007-01-26
dc.date.accessioned2026-07-07T07:43:14Z
dc.date.available2026-07-07T07:43:14Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0701164
dc.identifierhttp://arxiv.org/abs/cs/0701164
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122744
dc.subjectDatabases
dc.subjectData Structures and Algorithms
dc.titleIndexing the Sphere with the Hierarchical Triangular Mesh
dc.typetext

Files

Collections

arXiv