title: Multiresolution indexing of triangulated irregular networks.
abstract: We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, the space within each triangle is continuously indexed with a space-filling curve that begins at one vertex of the triangle and ends at another. The space-filling curve is oriented such that the first point in each triangle is a vertex shared with the previous triangle and the last point is a vertex shared with the next triangle. Furthermore, our index can be refined locally and, therefore, efficiently when the TIN is augmented by filling any face with another TIN (to make a hierarchical TIN). Such processes arise, for example, in the elaboration of detail on a graphical surface.
authors.affiliation: School of Industial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA. john.bartholdi@isye.gatech.edu
authors.forename: John
authors.initials: J
authors.lastname: J Bartholdi
authors.forename: Paul
authors.initials: P
authors.lastname: Goldsman
mesh_terms: D000465:Algorithms; D003196:Computer Graphics; D007089:Image Enhancement / Q000379:methods; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D012815:Signal Processing, Computer-Assisted