Hierarchical triangular mesh
{{Short description|Data structure for storing geometric information}}
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.{{cite arXiv | eprint=cs/0701164 | last1=Szalay | first1=Alexander S. | last2=Gray | first2=Jim | last3=Fekete | first3=George | last4=Kunszt | first4=Peter Z. | last5=Kukol | first5=Peter | last6=Thakar | first6=Ani | title=Indexing the Sphere with the Hierarchical Triangular Mesh | year=2007 }}
Functions
- It provides a systematic indexing method for objects localized on a sphere.{{cite book |last1=Kunszt |first1=Peter Z. |last2=Szalay |first2=Alexander S. |last3=Thakar |first3=Aniruddha R. |year=2001 |chapter-url=https://www.researchgate.net/publication/226072008 |chapter=The Hierarchical Triangular Mesh |editor-last=Banday |editor-first=Anthony J. |editor2-last=Zaroubi |editor2-first=Saleem |editor3-last=Bartelmann |editor3-first=Matthias |title=Mining the Sky |series=ESO Astrophysics Symposia |location=Berlin, Heidelberg |publisher=Springer |pages=631–637 |bibcode=2001misk.conf..631K |doi=10.1007/10849171_83 |isbn=3-540-42468-7 }}
- It is an efficient method for searching different resolutions like arc seconds or hemispheres.
- It can be used as a method to subdivide the spherical surface into triangles of nearly equal shape and size.
See also
References
{{Reflist}}
{{algorithm-stub}}
Category:3D graphics software that uses Qt