{"id":15062,"date":"2022-06-16T20:34:34","date_gmt":"2022-06-17T00:34:34","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=15062"},"modified":"2022-06-16T20:34:34","modified_gmt":"2022-06-17T00:34:34","slug":"tr-217-indexing-on-spherical-surfaces-using-semi-quadcodes","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1992\/tr-217-indexing-on-spherical-surfaces-using-semi-quadcodes\/","title":{"rendered":"TR-217: Indexing on Spherical Surfaces Using Semi-Quadcodes"},"content":{"rendered":"

Carleton University
\nTechnical Report<\/a> TR-217<\/strong>
\nDecember 1992<\/p>\n

Indexing on Spherical Surfaces Using Semi-Quadcodes<\/h2>\n
Ekow J. Otoo & Hongwen Zhu<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n

The conventional method of referencing a point on a spherical surface of known radius is by specifying the angular position of<\/> and A with respect to an origin at the centre. This is akin to the ( x, y) coordinates system in R2 cartesian plane. To spec\u00adify a region in the cartesian plane, two points corresponding to the diagonal points (xi, Y1) and (x2, Y2) are sufficient to characterize the region. Given any bounded region, of 2h x 2h an alternate form of referencing a square subregion is by the linear quadtree address [9] or quadcode [12]. Corresponding encoding scheme for spherical surfaces is lacking. Recently a method similar to the quadtree recursive decomposi\u00adtion method has been proposed independently by Dutton and Fekete. Namely, the quaternary triangular mesh (QTM) [4] and the spherical quadtree (SDT) [7]. The addressing method of the triangular regions suggested are very similar. We present a new labeling method for the triangular patches on the sphere that allows for a better and more efficient operation and indexing on spherical surfaces.<\/p>\n

<\/div>\n

TR-217.pdf<\/a><\/p>\n