LSST Applications 27.0.0,g0265f82a02+469cd937ee,g02d81e74bb+21ad69e7e1,g1470d8bcf6+cbe83ee85a,g2079a07aa2+e67c6346a6,g212a7c68fe+04a9158687,g2305ad1205+94392ce272,g295015adf3+81dd352a9d,g2bbee38e9b+469cd937ee,g337abbeb29+469cd937ee,g3939d97d7f+72a9f7b576,g487adcacf7+71499e7cba,g50ff169b8f+5929b3527e,g52b1c1532d+a6fc98d2e7,g591dd9f2cf+df404f777f,g5a732f18d5+be83d3ecdb,g64a986408d+21ad69e7e1,g858d7b2824+21ad69e7e1,g8a8a8dda67+a6fc98d2e7,g99cad8db69+f62e5b0af5,g9ddcbc5298+d4bad12328,ga1e77700b3+9c366c4306,ga8c6da7877+71e4819109,gb0e22166c9+25ba2f69a1,gb6a65358fc+469cd937ee,gbb8dafda3b+69d3c0e320,gc07e1c2157+a98bf949bb,gc120e1dc64+615ec43309,gc28159a63d+469cd937ee,gcf0d15dbbd+72a9f7b576,gdaeeff99f8+a38ce5ea23,ge6526c86ff+3a7c1ac5f1,ge79ae78c31+469cd937ee,gee10cc3b42+a6fc98d2e7,gf1cff7945b+21ad69e7e1,gfbcc870c63+9a11dc8c8f
LSST Data Management Base Package
|
The Hierarchical Triangular Mesh (HTM) is described in the work of A. Szalay, T. Budavari, G. Fekete at The Johns Hopkins University, and Jim Gray, Microsoft Research. See in particular the following paper:
"Indexing the Sphere with the Hierarchical Triangular Mesh" Szalay, Alexander S.; Gray, Jim; Fekete, George; Kunszt, Peter Z.; Kukol, Peter; Thakar, Ani 2007, Arxiv e-prints
http://arxiv.org/abs/cs/0701164 http://adsabs.harvard.edu/abs/2007cs........1164S
To summarize very briefly: HTM partitions the unit sphere into 8 root triangles by splitting it with the planes x = 0, y = 0, and z = 0. A triangle is subdivided into 4 children by connecting the midpoints of its edges with geodesics, and each root triangle is recursively subdivided to a fixed subdivision level to obtain a pixelization of the sphere. The root triangles are assigned indexes 8-15, and the children of a triangle with index I are assigned indexes [4*I, 4*I + 4).
Budavári, Tamás; Szalay, Alexander S.; Fekete, György "Searchable Sky Coverage of Astronomical Observations: Footprints and Exposures" Publications of the Astronomical Society of Pacific, Volume 122, Issue 897, pp. 1375-1388 (2010).