Variable-scale Topological Data Structures Suitable for Progressive Data Transfer: The GAP- face Tree and GAP-edge Forest

This paper presents the first data structure for a variable scale representation of an area partitioning without redundancy of geometry. At the highest level of detail, the areas are represented using a topological structure based on faces and edges; there is no redundancy of geometry in this structure as the shared boundaries (edges) between neighbor areas are stored only once. Each edge is represented by a Binary Line Generalization (BLG)-tree, which enables selection of the proper repre- sentation for a given scale. Further, there is also no geometry redundancy between the different levels of detail. An edge at a higher importance level (less detail) does not contain copies of the lower-level edges or coordinates (more detail), but it is represented by efficiently combining their corresponding BLG trees. Which edges have to be combined follows from the generalization computation, and this is stored in a data structure. This data structure turns out to be a set of trees, which will be called the (Generalized Area Partitioning) GAP-edge forest. With regard to faces, the generalization result can be captured in a single tree structure for the parent-child relationships—the GAP face-tree. At the client side there are no geometric computations necessary to compute the polygon representations of the faces, merely following the topological references is sufficient. Finally, the presented data structure is also suitable for progressive transfer of vector maps, assuming that the client maintains a local copy of the GAP-face tree and the GAP-edge forest.

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

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

[3]  Bruce G. Baumgart A polyhedron representation for computer vision , 1975, AFIPS '75.

[4]  Dana H. Ballard,et al.  Strip trees: a hierarchical representation for curves , 1981, CACM.

[5]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[6]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[7]  Oliver Günther,et al.  Efficient Structures for Geometric Data Management , 1988, Lecture Notes in Computer Science.

[8]  P.J.M. van Oosterom,et al.  A reactive data structure for geographic information systems , 1989 .

[9]  Peter van Oosterom,et al.  A storage structure for a multi-scale database: The reactive-tree , 1992 .

[10]  Peter van Oosterom,et al.  Reactive Data Structures for Geographic Information Systems , 1993 .

[11]  Peter van Oosterom,et al.  The Development of an Interactive Multi-Scale GIS , 1995, Int. J. Geogr. Inf. Sci..

[12]  P.J.M. van Oosterom,et al.  The GAP-tree, an approach to "on-the-fly' map generalization of an area partitioning , 1995 .

[13]  A. K. Bregt,et al.  Application-oriented generalization of area objects , 1996 .

[14]  van J.W.N. Smaalen A hierarchic rule model for geographic information abstraction. , 1996 .

[15]  Fabien Robineau,et al.  OpenGIS Simple Features Specification For SQL, Revision 0 , 1997 .

[16]  M. V. Kreveld,et al.  Topologically correct subdivision simplification using the bandwidth criterion , 1998 .

[17]  Sharad Mehrotra,et al.  Progressive approximate aggregate queries with a multi-resolution tree structure , 2001, SIGMOD '01.

[18]  P.J.M. van Oosterom,et al.  Spatial data management on a very large cadastral database , 2001 .

[19]  Michela Bertolotto,et al.  Progressive Transmission of Vector Map Data over the World Wide Web , 2001, GeoInformatica.

[20]  Sisi Zlatanova,et al.  The Balance Between Geometry and Topology , 2002 .

[21]  Tinghua Ai,et al.  GAP-Tree Extensions Based on Skeletons , 2002 .

[22]  Barbara P. Buttenfield,et al.  Transmitting Vector Geospatial Data across the Internet , 2002, GIScience.

[23]  J.W.N. van Smaalen,et al.  Automated aggregation of geographic objects: A new approach to the conceptual generalisation of geographic databases , 2003 .

[24]  P.J.M. van Oosterom,et al.  Storing and using scale-less topological data efficiently in a client-server DBMS environment , 2003 .

[25]  M. J. Vermeij Development of a Topological Data Structure for On-the-Fly Map Generalization , 2003 .

[26]  Heidrun Schumann,et al.  Remote Raster Image Browsing Based on Fast Content Reduction forMobile Environments , 2004, Eurographics Multimedia Workshop.

[27]  Xiaofang Zhou,et al.  Multiresolution Spatial Databases: Making Web-Based Spatial Applications Faster , 2004, APWeb.

[28]  John Hildebrandt,et al.  CLUSTER RAPTOR : Dynamic Geospatial Imagery Visualisation using Backend Repositories , .