This article explores Automatic generalization of Map Resident in digital environment that include creating neighboring network based on Delaunay triangulation, constructing minimum spanning tree from neighboring network, to determine the polygon grouping strategy based on minimum spanning tree, then explore polygon merging and removing algorithm. This method can retain important features of geographic features while maintaining a good capacity and readability, finally obtaining multi-scale maps.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.