Jump to content

Hierarchical triangular mesh

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kri (talk | contribs) at 10:05, 19 October 2023 (The HTM is based on subdivision of a distorted octahedron). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Diagram of Hierarchical Triangular Mesh (HTM). The spherical polygons are the projection of the edges of the octahedron onto the circumscribing sphere.

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]

References

  1. ^ a b Szalay, Alexander S.; Gray, Jim; Fekete, George; Kunszt, Peter Z.; Kukol, Peter; Thakar, Ani (2007). "Indexing the Sphere with the Hierarchical Triangular Mesh". arXiv:cs/0701164.
  2. ^ a b Kunszt, Peter Z.; Szalay, Alexander S.; Thakar, Aniruddha R. (2001). "The Hierarchical Triangular Mesh". In Banday, Anthony J.; Zaroubi, Saleem; Bartelmann, Matthias (eds.). Mining the Sky. ESO Astrophysics Symposia. Berlin, Heidelberg: Springer. pp. 631–637. Bibcode:2001misk.conf..631K. doi:10.1007/10849171_83. ISBN 3-540-42468-7.
Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Hierarchical_triangular_mesh&oldid=1180870025"