Strip trees: a hierarchical representation for curves
TLDR
Strip trees is a linear interpolation scheme which realizes an important space savings by not representing all the points explicitly, and 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 explicit.Abstract:
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.read more
Citations
More filters
Journal ArticleDOI
The Quadtree and Related Hierarchical Data Structures
TL;DR: L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques and the robotique.
Journal ArticleDOI
Three-dimensional object recognition from single two-dimensional images
TL;DR: It is argued that similar mechanisms and constraints form the basis for recognition in human vision.
Journal ArticleDOI
Efficient collision detection using bounding volume hierarchies of k-DOPs
TL;DR: This work develops and analyzes a method, based on bounding-volume hierarchies, for efficient collision detection for objects moving within highly complex environments, and provides experimental evidence showing that this approach yields substantially faster collision detection than previous methods.
Survey of Polygonal Surface Simplification Algorithms
Paul S. Heckbert,Michael Garland +1 more
TL;DR: Methods for simplifying and approximating polygonal surfaces from computer graphics, computer vision, cartography, computational geometry, and other fields are classified, summarized, and compared both practically and theoretically.
Journal ArticleDOI
Shapes, shocks, and deformations I: the components of two-dimensional shape and the reaction-diffusion space
TL;DR: The principles are organized around two basic intuitions: first, if a boundary were changed only slightly, then, in general, its shape would change only slightly; and second, that not all contours are shapes, but rather only those that can enclose “physical” material.
References
More filters
Journal ArticleDOI
Pattern Classification and Scene Analysis.
Book
Pattern classification and scene analysis
Richard O. Duda,Peter E. Hart +1 more
TL;DR: In this article, a unified, comprehensive and up-to-date treatment of both statistical and descriptive methods for pattern recognition is provided, including Bayesian decision theory, supervised and unsupervised learning, nonparametric techniques, discriminant analysis, clustering, preprosessing of pictorial data, spatial filtering, shape description techniques, perspective transformations, projective invariants, linguistic procedures, and artificial intelligence techniques for scene analysis.
Journal ArticleDOI
Multidimensional binary search trees used for associative searching
TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Journal ArticleDOI
Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
TL;DR: In this paper, two algorithms to reduce the number of points required to represent the line and, if desired, produce caricatures are presented and compared with the most promising methods so far suggested.
Book
Perceptrons: An Introduction to Computational Geometry
Marvin Minsky,Seymour A. Papert +1 more
TL;DR: The aim of this book is to seek general results from the close study of abstract version of devices known as perceptrons.