Representing Forested Regions at Small Scales: Automatic Derivation from Very Large Scale Data

Abstract As with any class of feature, it is important to be able to view woodland or forest at multiple levels of detail. At the detailed level, a map can show clusters of trees, tree types, tracks and paths; at the small scale, say 1:250 000, we can discern broad patterns of forests and other land use, which can inform planners and act as input to land resource models. Rather than store such information in separate databases (requiring multiple points of maintenance), the vision is that the information has a single point of storage and maintenance, and that from this detailed level, various, more generalised forms can be automatically derived. This paper presents a methodology and algorithm for automatically deriving forest patches suitable for representation at 1:250 000 scale directly from a detailed dataset. In addition to evaluation of the output, the paper demonstrates how such algorithms can be shared and utilised via 'generalisation web services', arguing that the sharing of such algorithms can help accelerate developments in map generalisation, and increase the uptake of research solutions within commercial systems.

[1]  K. Briffa,et al.  Seeing the Wood from the Trees , 1999, Science.

[2]  J. D. Whyatt,et al.  Line generalisation by repeated elimination of points , 1993 .

[3]  Christopher M. Gold,et al.  Outside-in: An Alternative Approach to Forest Map Digitizing , 1996, Int. J. Geogr. Inf. Sci..

[4]  International symposium on spatial data handling , 1984 .

[5]  Kothuri Venkata Ravi Kanth,et al.  Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data , 2002, SIGMOD '02.

[6]  Patrick Revell,et al.  Seeing the Wood from the Trees : Generalising OS MasterMap ® Tree Coverage Polygons to Woodland at 1 : 50 000 Scale , 2005 .

[7]  Robert Weibel,et al.  Three essential building blocks for automated generalization , 2020 .

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

[9]  Andrew U. Frank,et al.  Multiple representations for cartographic objects in a multi-scale tree - An intelligent graphical zoom , 1994, Comput. Graph..

[10]  Anne Ruas,et al.  Modelling the Overall Process of Generalisation , 2013 .

[11]  Robert Weibel,et al.  Generalization Services on the Web—Classification and an Initial Prototype Implementation , 2005 .

[12]  Christopher M. Gold The Quad-Arc Data Structure , 1999 .

[13]  Moritz Neun,et al.  Experiments in Building an Open Generalisation System , 2007 .

[14]  Moritz Neun,et al.  Web Services for an Open Generalisation Research Platform , 2005 .

[15]  William Mackaness,et al.  Self Evaluating Generalisation Algorithms to Automatically Derive Multi Scale Boundary Sets , 1998 .

[16]  Robert B McMaster,et al.  Introduction: Scale and Geographic Inquiry , 2008 .

[17]  N. Regnauld,et al.  A synoptic View of Generalisation Operators , 2007 .

[18]  Zhilin Li,et al.  Digital Map Generalization at the Age of Enlightenment: a Review of the First Forty Years , 2007 .

[19]  J. C. Müller,et al.  Area-patch generalisation: a competitive approach , 1992 .

[20]  Lars Harrie,et al.  An Optimisation Approach to Cartographic Generalisation , 2001 .