Jump to content

Hierarchical triangular mesh

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Old Man Consequences (talk | contribs) at 14:23, 7 January 2023 (stub sort). 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.[1]

Functions

  • It provides a systematic indexing method for objects localized on a sphere.[2]
  • It is also efficient at good at searches at different resolutions like arc seconds, hemispheres.[3]
  • It can be used as a method to subdivide the spherical surface into triangles of nearly equal shape and size.[4]

References

  1. ^ https://arxiv.org/ftp/cs/papers/0701/0701164.pdf
  2. ^ 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.
  3. ^ 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.
  4. ^ https://www.researchgate.net/publication/226072008_The_Hierarchical_Triangular_Mesh
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=1132153241"