The use of curves to represent two-dimensional structures is an important part of many scientific investigations. For example, geographers use curves extensively to represent map features such as contour lines, roads, and rivers. Circuit layout designers use curves to specify the wiring between circuits. Because of the very large amount of data involved and the need to perform operations on this data efficiently, the representation of such curves is a crucial issue. A hierarchical representation consisting of binary trees with a special datum at each node is described. This datum is called a strip and the tree that contains such data is called a strip tree. Lower levels in the tree correspond to finer resolution representations of the curve. The strip tree structure is a direct consequence of using a special method for digitizing lines and retaining all intermediate steps. This gives several desirable properties. For curves that are well-behaved, intersection and point-membership (for closed curves) calculations can be solved in 0(log n) where n is the number of points describing the curve. The curves can be efficiently encoded and displayed at various resolutions. The representation is closed under intersection and union and these operations can be carried out at different resolutions. All these properties depend on the hierarchical tree structure which allows primitive operations to be performed at the lowest possible resolution with great computational time savings.
Strip trees is a linear interpolation scheme which realizes an important space savings by not representing all the points explicitly. This means that even when the overhead of the tree indexing is added, the storage requirement is comparable to raster representations which do represent most of the points explicitly.

[1]
Marvin Minsky,et al.
Perceptrons: An Introduction to Computational Geometry
,
1969
.

[2]
R. D. Merrill.
Representation of contours and regions for efficient computer search
,
1973,
CACM.

[3]
Richard O. Duda,et al.
Pattern classification and scene analysis
,
1974,
A Wiley-Interscience publication.

[4]
David H. Douglas,et al.
ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE
,
1973
.

[5]
Kenneth J. Turner,et al.
Computer perception of curved objects using a television camera
,
1974
.

[6]
T. Peucker.
A THEORY OF THE CARTOGRAPHIC LINE
,
1975
.

[7]
Jon Louis Bentley,et al.
Multidimensional binary search trees used for associative searching
,
1975,
CACM.

[8]
佐藤 孝紀,et al.
A Hierarchical Data Structure for Picture Processing
,
1976
.

[9]
H. Barrow.
Interactive Aids for Cartography and Photo Interpretation
,
1976
.

[10]
Warren Burton,et al.
Representation of many-sided polygons and polygonal lines for rapid processing
,
1977,
CACM.

[11]
I. Good,et al.
Fractals: Form, Chance and Dimension
,
1978
.

[12]
Donna J. Peuquet,et al.
Raster Processing: An Alternative Approach to Automated Cartographic Data Handling
,
1979
.

[13]
Azriel Rosenfeld,et al.
Region representation: boundary codes from quadtrees
,
1980,
CACM.

[14]
Hanan Samet,et al.
Region representation: quadtrees from boundary codes
,
1980,
CACM.