Concepts of use in contour map processing
Communications of the ACM
Communications of the ACM
Compound data structure for computer aided design; a survey
ACM '67 Proceedings of the 1967 22nd national conference
Tabular representation of multivariate functions—with applications to topographic modeling
ACM '67 Proceedings of the 1967 22nd national conference
A rule-based system for dense-map name placement
Communications of the ACM
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Strip trees: a hierarchical representation for curves
Communications of the ACM
Representation of many-sided polygons and polygonal lines for rapid processing
Communications of the ACM
Automated inspection of electronic assemblies
DAC '74 Proceedings of the 11th Design Automation Workshop
Identification and reconstruction of bullets from multiple X-rays
AFRIGRAPH '06 Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Efficiency of chain codes to represent binary objects
Pattern Recognition
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
Integrated data bases for municipal decision-making
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
A new and fast contour-filling algorithm
Pattern Recognition
Projection filling based on contour structural points
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
| Hi-index | 48.26 |
A novel computer-searchable representation for the three basic pictorial features, contour maps, region coverage, and line structures, is described. The representation, which has practical storage requirements, provides a rapid means of searching large files for data associated with geometric position as well as with attribute value. An application of this representation to handling terrain information illustrates its utility. The algebraic properties of the data structure make it computationally easy to determine whether a point lies within a closed boundary; compute the area contained by a closed boundary; generate the closed boundary representing the union or intersection of two closed boundaries; and determine the neighboring boundaries to a point and the minimum distances between them and the point.