| |
A polygon including a single data point, or node, and bounded by line segments equidistant between the included point and nearby nodes. All locations within the polygon lie closer to the included data point than to any other node, and its sides are the perpendicular bisectors of lines connecting nearby nodes. In addition to delineating areas of dominance around points, Thiessen polygons (also called Voronoi polygons) provide a framework for the triangulated irregular network (TIN) data structure, which describes a three-dimensional terrain surface based on elevations measured at irregularly spaced data points (Peucker and Chrisman, 1975). (MM)
Reference Peucker, T.K. and Chrisman, N. 1975: Cartographic data structures. The American Cartographer 2: 55-69 . |
|
