Hierarchical triangular mesh

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
File:HTM-diagram.png
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

[edit | edit source]
  • 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

[edit | edit source]

References

[edit | edit source]
  1. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
Stub icon

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

Retrieved from "http://70.231.62.181/index.php?title=Hierarchical_triangular_mesh&oldid=15952205"