Hierarchical triangular mesh explained
Hierarchical Triangular Mesh (HTM) is a kind of quad tree based on subdivision of a distorted octahedron, 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.[1]
- It can be used as a method to subdivide the spherical surface into triangles of nearly equal shape and size.[2]
See also
Notes and References
- cs/0701164 . Szalay . Alexander S. . Gray . Jim . Fekete . George . Kunszt . Peter Z. . Kukol . Peter . Thakar . Ani . Indexing the Sphere with the Hierarchical Triangular Mesh . 2007 .
- Book: Kunszt . Peter Z. . Szalay . Alexander S. . Thakar . Aniruddha R. . 2001 . https://www.researchgate.net/publication/226072008 . The Hierarchical Triangular Mesh . Banday . Anthony J. . Zaroubi . Saleem . Bartelmann . Matthias . Mining the Sky . ESO Astrophysics Symposia . Berlin, Heidelberg . Springer . 631–637 . 2001misk.conf..631K . 10.1007/10849171_83 . 3-540-42468-7 .