Hierarchical triangular mesh
Hierarchical Triangular Mesh (HTM) is a kind of quad tree used for mesh generation in 3-D computer graphics and geometric data structures. [1]
Functions
- It provides a systematic indexing method for objects localized on a sphere.[2]
- It is an efficient method for searching different resolutions like arc seconds or hemispheres.[3]
- It can be used as a method to subdivide the spherical surface into triangles of nearly equal shape and size.[4]
References
- ^ https://arxiv.org/ftp/cs/papers/0701/0701164.pdf
- ^ Kunszt, Peter Z.; Szalay, Alexander S.; Thakar, Aniruddha R. (2001). Banday, Anthony J.; Zaroubi, Saleem; Bartelmann, Matthias (eds.). "The Hierarchical Triangular Mesh". Mining the Sky. Berlin, Heidelberg: Springer: 631–637. doi:10.1007/10849171_83. ISBN 978-3-540-44665-1.
- ^ Szalay, Alexander S.; Gray, Jim; Fekete, George; Kunszt, Peter Z.; Kukol, Peter; Thakar, Ani (2007-01-01). "Indexing the Sphere with the Hierarchical Triangular Mesh". arXiv e-prints: cs/0701164.
- ^ https://www.researchgate.net/publication/226072008_The_Hierarchical_Triangular_Mesh
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |