Generalization Operations and Supporting Structures

Current GIS do not support wide flexibility for the performance of map generalization operations so users have limited opportunity for creating views of data at different levels of resolution. This paper describes a context for computer assisted generalization and reports on a set of generalization operators. The generalization operators are embedded within a larger scheme for a map design system which could be attached to a GIS. The selection and sequencing of operations is not fully automated but relies on user interaction. This approach is adopted to allow users maximum flexibility in tailoring maps to their individual needs. The system, however, is designed to provide substantial support for the user in negotiating this process. The final section of the paper describes data structures for supporting the operations within the context of this interactive environment.

[1]  Walter A. Burkhard.  Interpolation-based index maintenance , 1983, BIT Comput. Sci. Sect..

[2]  Jack A. Orenstein.  A Dynamic Hash File for Random and Sequential Accessing , 1983, VLDB.

[3]  Makoto Nagao,et al.  A file organization for geographic information systems based on spatial proximity , 1983, Comput. Vis. Graph. Image Process..

[4]  Christopher M. Gold,et al.  Spatially ordered networks and topographic reconstructions , 1987, Int. J. Geogr. Inf. Sci..

[5]  Roger King,et al.  Semantic Data Models , 1985, Principles of Database Design.

[6]  Mary Kate Beard.  Multiple representations from a detailed database : a scheme for automated generalization , 1988 .

[7]  K. S. Shea,et al.  Cartographic generalization in a digital environment: a framework for implementation in a geographic information system , 1988 .

[8]  F. Töpfer,et al.  The Principles of Selection , 1966 .

[9]  William Alfred Mackaness.  Knowledge-based resolution of spatial conflicts in digital map design , 1988 .

[10]  Robert B McMaster.  Introduction to ‘Numerical Generalization in Cartography’ , 1989 .

[11]  K. S. Shea,et al.  Cartographic generalization in a digital environment: when and how to generalize , 1989 .

[12]  Robert Weibel,et al.  A review and conceptual framework of automated map generalization , 1988, Int. J. Geogr. Inf. Sci..

[13]  Ronald Fagin,et al.  Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems , 1983, PODS 1983.

[14]  T. H. Merrett,et al.  A class of data structures for associative searching , 1984, PODS.

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

[16]  Walter A. Burkhard,et al.  Interpolation-based index maintenance , 1983, BIT.

[17]  Robin Sibson,et al.  Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[18]  Andrew Turk,et al.  Towards an understanding of human-computer interaction aspects of geographic information systems , 1990 .

[19]  Hermann Tropf,et al.  Multimensional Range Search in Dynamically Balanced Trees , 1981, Angew. Inform..

[20]  Henry J. Steward.  Cartographic Generalisation Some Concepts and Explanation , 1974 .

[21]  G. R. P. Lawrence,et al.  CARTOGRAPHIC DESIGN AND PRODUCTION , 1975 .

[22]  Aris M. Ouksel,et al.  Storage mappings for multidimensional linear dynamic hashing , 1983, PODS.