Approximation of polygonal maps by cellular maps

Authors:
George Nagy;Sharad G. Wagle
Affiliations:
The Univ. of Nebraska-Lincoln;The Univ. of Nebraska-Lincoln
Venue:
Communications of the ACM
Year:
1979

Citing 3
Cited 3

Representation of many-sided polygons and polygonal lines for rapid processing

Communications of the ACM
Boundary networks

Communications of the ACM
Geometric complexity

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

Geographic Data Processing

ACM Computing Surveys (CSUR)
Efficient spatial access to a data base

SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
PICQUERY: A High Level Query Language for Pictorial Database Management

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	48.23

Visualization

Abstract

The approximation of polygonal thematic maps by cellular maps, an important operation in geographical data processing, is analyzed. The data organization used for representing the polygonal maps is a widely used segment-based data structure, where class labels identify the regions bordering each segment on either side. The approximation algorithm presented operates on such an organization, eliminating the need for the recognition of region boundaries. Each segment is examined only once. The versatility of the new organization is further illustrated by the outline of algorithms for area computation and point inclusion. The algorithm is applied to a set of soil maps converted to computer-readable form by means of a coordinate digitizer. reachable along paths from any given node.