arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0701164cs.DBcs.DS
收藏

用层次三角网格索引球体

Indexing the Sphere with the Hierarchical Triangular Mesh

Alexander S. Szalay, Jim Gray, George Fekete, Peter Z. Kunszt, Peter Kukol, Ani Thakar

摘要:

我们描述了一种方法来细分的球面成类似的球面三角形,但不相同,形状和大小。层次三角网格(HTM)是一种四叉树,特别适合支持不同分辨率的搜索,从弧秒到半球。细分方案是通用的,为寻址和快速查找提供了基础。HTM为关系数据库中的高效地理空间索引方案提供了基础,其中数据在天球或地球上具有固有位置。HTM指数优于在极点处使用奇点坐标的制图方法。我们还描述了一种方法来指定表面区域,有效地表示球形查询区域。本文提出了用于识别覆盖这些区域的HTM三角形的算法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑