Description Approaches and Automated Generalization Algorithms for Groups of Map Objects

235 Pages·2019·7.478 MB·English

by  Haowen Yan

Haowen Yan
Description Approaches
and Automated
Generalization
Algorithms for Groups
of Map Objects
Description Approaches and Automated
Generalization Algorithms for Groups
of Map Objects
Haowen Yan
Description Approaches and
Automated Generalization
Algorithms for Groups
of Map Objects
HaowenYan
FacultyofGeomatics
LanzhouJiaotongUniversity
Lanzhou,Gansu,China
ISBN978-981-13-3677-5 ISBN978-981-13-3678-2 (eBook)
https://doi.org/10.1007/978-981-13-3678-2
LibraryofCongressControlNumber:2018964703
©SpringerNatureSingaporePteLtd.2019
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe
materialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation,
broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology
nowknownorhereafterdeveloped.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
The publisher, the authors, and the editorsare safeto assume that the adviceand informationin this
bookarebelievedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsor
theeditorsgiveawarranty,expressorimplied,withrespecttothematerialcontainedhereinorforany
errorsoromissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictional
claimsinpublishedmapsandinstitutionalaffiliations.
ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSingaporePteLtd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
Preface
Map generalization seeks to maintain and improve the legibility of a map after the
scalehasbeenchanged.Automatedmapgeneralizationisanecessarytechniquefor
theconstructionofmulti-scalevectormapdatabasesthatarecrucialcomponentsin
spatialdatainfrastructureofcities,provinces,andcountries.Nevertheless,thisisan
unrealized dream yet, because many algorithms for map feature generalization are
nottrulyautomaticandthereforeneedhuman’sinterference.
In recent decades, scholars in the communities of cartography and geographic
informationscienceshavebeenmakinggreateffortonthetheoriesandmethodsfor
automated map generalization and have gotmany achievements, including various
indices, operators, and algorithms for map feature generalization and softwares for
automatedmapgeneralization(thoughtheyaregenerallysemiautomated).
Asfarasthealgorithmsformapfeaturegeneralizationareconcerned,theonesfor
individualobjectsgeneralizationhavebeenmatureandcanbeputintopracticaluse,
whiletheonesforgroupsofobjectsgeneralizationarestillonthewayandneedmore
investigations,thoughmuchprogresshasbeenmade.
This book emphasizes on representation and generalization of groups of map
features. It is well known that map objects can be classified into three categories
accordingtotheirgeometriccharacter,i.e.,point,linear,andareal.Ifonlygroupsof
objects on maps are considered, we have point clusters, linear networks, and areal
groups.Inthemeanwhile,ifmapfeaturetypeisconsidered,wehavepointclusters,
groups of contours, road networks, river networks, continuous areal features, and
discrete areal features. Thus, the chapters of the book are arranged in this classifi-
cation.Thisbookbelievesthatrepresentationmethodsareasimportantasgeneral-
izationalgorithmsinmapgeneralization;hence,itspendsmuchwordsondescribing
mapfeaturerepresentationmethods.
Theauthorwouldliketoexpresshisappreciationstomanypeoplewhomadethe
completionofthisbookpossible.Aboveall,heisgratefultoDr.RobertWeibelin
theDepartmentofGeography,UniversityofZurich,Switzerland;Dr.ZhilinLiinthe
Department of Land Surveying and Geo-Informatics, Hong Kong Polytechnic
University, Hong Kong; and Professor Jiayao Wang in the PLA Information
v
vi Preface
EngineeringUniversity,China,whodiscussedmanytopicswiththeauthoryearsago
attheearlystageofthisbook.Second,theauthorsfeelsoindebtedtoDr.Xiaomin
Lu,Dr.HaiyingWang,Dr.JiangleiJin,andDr.HongyuanFanwhodrewgraphics
and/or checked language for the draft of the book. Last but not least, the author
appreciates the Natural Science Foundation of China (No. 41671447 and
No. 71563025) and the National Key R&D Program of China
(No. 2017YFB0504203) for their financial support to the work described in the
book.
Thebookcanbeareferencetothegraduatesandresearcherswhoareinterestedin
cartography and geographic information science/systems, especially those in auto-
mated map generalization and spatial database construction. Any comments and
suggestionsregardingthisbookaregreatlywelcomedandappreciated.
Lanzhou,China HaowenYan
July30,2018
Contents
1 Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Multi-scaleRepresentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 DigitalEarth:ApplicationsofMulti-scaleRepresentation. . . . . . 3
1.3 AutomatedMapGeneralization:ImplementationofMulti-scale
VectorMapDatabases. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.4 ReviewoftheApproachestoDescribingMapFeaturesandthe
AlgorithmsforAutomatedMapGeneralization. . . . . . . . . . . . . . 4
1.4.1 ApproachestoDescribingMapFeatures. . . . . . . . . . . . . 5
1.4.2 AlgorithmsforAutomatedMapGeneralization. . . . . . . . 7
1.5 ScopeoftheBook. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.6 OrganizationoftheBook. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
2 DescriptionandGeneralizationofPointClusteringFeatures. . . . . . 17
2.1 Multi-scaleRepresentationsofPointClusteringFeatures. . . . . . . 17
2.2 TypesofPointClusteringFeaturesonMaps. . . . . . . . . . . . . . . . 19
2.3 ApproachedtoDescribingPointClusteringFeatures. . . . . . . . . . 21
2.3.1 InformationContainedinPointClusters. . . . . . . . . . . . . 21
2.3.2 MeasuresforTypesofInformationContainedinPoint
Clusters. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
2.4 AlgorithmsforPointClusteringFeaturesGeneralization. . . . . . . 24
2.4.1 AlgorithmsforSettlementSelection. . . . . . . . . . . . . . . . 24
2.4.2 TheDotMapSimplificationAlgorithm. . . . . . . . . . . . . . 27
2.4.3 TheOn-the-FlyPointClusteringThematicFeature
GeneralizationAlgorithms. . . . . . . . . . . . . . . . . . . . . . . 28
2.4.4 TheVoronoi-BasedAlgorithm. . . . . . . . . . . . . . . . . . . . 30
2.5 Discussions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
2.6 SummaryoftheChapter. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
vii
viii Contents
3 DescriptionandGeneralizationofContourLines. . . . . . . . . . . . . . . 39
3.1 DefinitionandCharacteristicsofContourLines. . . . . . . . . . . . . 39
3.2 ContourTree:ARepresentationofGroupsofContourLines. . . . 40
3.2.1 AnalysisoftheProblem. . . . . . . . . . . . . . . . . . . . . . . . . 42
3.2.2 AutomaticGenerationofClosedContourLines. . . . . . . . 43
3.2.3 ConstructionofContourTrees. . . . . . . . . . . . . . . . . . . . 45
3.2.4 DetectingTopographicTerrainLinesbyMeans
ofContourTrees. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
3.3 DescriptionofContourLinesbyTopographicTerrainLines. . . . 50
3.3.1 AnalysisoftheCurvaturesofaSingularContour
LineandConstructionofItsBinaryTree. . . . . . . . . . . . . 51
3.3.2 SelectionofSubsectionsofValleys. . . . . . . . . . . . . . . . . 51
3.3.3 DetectionofSharpPeaksofValleys. . . . . . . . . . . . . . . . 52
3.3.4 ConstructionofPlanStructuralTrees. . . . . . . . . . . . . . . 54
3.3.5 OrganizationofSemanticHierarchicalTrees. . . . . . . . . . 56
3.4 GeneralizationofGroupsofContourLines. . . . . . . . . . . . . . . . . 58
3.4.1 ADirectGeneralizationAlgorithm. . . . . . . . . . . . . . . . . 58
3.4.2 AnIndirectGeneralizationAlgorithm. . . . . . . . . . . . . . . 60
3.4.3 DiscussionoftheAlgorithmsforContourMap
Generalization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
3.5 SummaryoftheChapter. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
4 DescriptionandGeneralizationofRoadNetworks. . . . . . . . . . . . . . 69
4.1 IntroductiontoRoadNetworks. . . . . . . . . . . . . . . . . . . . . . . . . 69
4.2 DescriptionofRoadNetworks. . . . . . . . . . . . . . . . . . . . . . . . . . 69
4.2.1 GraphTheory-BasedMethods. . . . . . . . . . . . . . . . . . . . 70
4.2.2 Stroke-BasedMethods. . . . . . . . . . . . . . . . . . . . . . . . . . 76
4.2.3 InformationTheory-BasedMethods. . . . . . . . . . . . . . . . 82
4.2.4 Mesh-BasedMethod. . . . . . . . . . . . . . . . . . . . . . . . . . . 83
4.2.5 Simulation-OrientedRoadDescriptions. . . . . . . . . . . . . . 86
4.3 FundamentalPrinciplesinRoadNetworkGeneralization. . . . . . . 86
4.4 ApproachesforGeneralizingRoadNetworks. . . . . . . . . . . . . . . 87
4.4.1 AGraphTheory-BasedApproachforSimplifying
RoadJunctions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
4.4.2 AStroke-BasedApproachforSimplifyingSchematic
NetworkMaps. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
4.4.3 ACartographicInformationTheory-BasedAlgorithm
forRoadNetworkSelection. . . . . . . . . . . . . . . . . . . . . . 98
4.4.4 MeshDensity-BasedApproachforSelectiveOmission
ofRoadNetworks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
4.4.5 SummaryoftheChapter. . . . . . . . . . .. . . . . . . . . . . . . . 105
References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106
Contents ix
5 DescriptionandGeneralizationofRiverNetworks. . . . . . . . . . . . . . 109
5.1 IntroductiontoRiverNetworks. . . . . . . . . . . . . . . . . . . . . . . . . 109
5.2 DescriptionsofRiverNetworks. . . . . . . . . . . . . . . . . . . . . . . . . 111
5.2.1 MeasuresandParameters. . . . . . . . . . . . . . . . . . . . . . . . 112
5.2.2 MethodsforDescribingRiverNetworks. . . . . . . . . . . . . 115
5.3 FundamentalPrinciplesforRiverNetworkGeneralization. . . . . . 126
5.4 ApproachesforGeneralizingRiverNetworks. . . . . . . . . . . . . . . 127
5.4.1 SelectingRiverSegmentsbyIndices. . . . . . . . . . . . . . . . 127
5.4.2 SelectingRiverSegmentsbytheRiverTree. . . . . . . . . . 128
5.4.3 AKnowledge-BasedApproachtoRiverNetwork
Generalization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131
5.4.4 AnApproachtoGeneralizingRiverNetworksbyCatchment
Area. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
5.4.5 RiverSelectionbytheBPNeuralNetworkAlgorithm. . . 137
5.4.6 RiverNetworkSelectionBasedonStructureandPattern
Recognition. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140
5.4.7 ComparisonoftheAlgorithmsforRiverNetwork
Generalization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
5.5 SummaryoftheChapter. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146
6 DescriptionandGeneralizationofContinuousArealFeatures. . . . . 149
6.1 IntroductiontoContinuousArealFeatures. . . . . . . . . . . . . . . . . 149
6.2 DescriptionofContinuousArealFeatures. . . . . . . . . . . . . . . . . . 151
6.2.1 TopologicalRelationsAmongContinuousPolygons. . . . 151
6.2.2 TopologicalRelationsonLand-UseMaps. . . . . . . . . . . . 159
6.2.3 NeighbouringRelationsonLand-UseMaps. . . . . . . . . . . 159
6.2.4 HorizontalandVerticalRelationsonLand-UseMaps. . . . 161
6.2.5 GeospatialSemanticRelationsonLand-Use/CoverMaps. 163
6.3 Principles/RulesinLandUse/CoverMapGeneralization. . . . . . . 171
6.4 GeneralizationofContinuousArealFeatures. . . . . . . . . . . . . . . 173
6.4.1 Rule-BasedLandCoverMapGeneralizationApproaches. 173
6.4.2 ArealPatchesGeneralizationApproachesConsidering
SpatialRelations. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
6.4.3 Agent-BasedApproachesforArealPatchesGeneralization 183
6.4.4 AVectorandRaster-BasedApproachforCategoricalMap
Generalization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 186
6.5 SummaryoftheChapter. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194
7 AlgorithmsforDiscreteArealFeatureGeneralization. . . . . . . . . . . 199
7.1 IntroductiontoDiscreteArealFeaturesonMaps. . . . . . . . . . . . . 199
7.2 DescriptionofGroupsofBuildings/Settlements. . . . . . . . . . . . . 199
7.2.1 GestaltPrinciplesforDescribingGroupsofBuildings. . . 199
x Contents
7.2.2 TwoTypesofConstraintsforBuildingsGrouping:Global
andLocal. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
7.3 Principles/RulesinDiscreteArealFeatureGeneralization. . . . . . 208
7.4 ApproachestoGeneralizingGroupsofBuildings/Settlements. . . 209
7.4.1 PossibleOperationsforBuildingGeneralization. . . . . . . . 210
7.4.2 BuildingGrouping. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
7.4.3 GeneralizationofBuildings. . . . . . . . . . . . . . . . . . . . . . 216
7.4.4 Experiments. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216
7.4.5 Discussions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217
7.5 PotentialResearchIssues. . . .. . . . . . . . . . . . . . . . . . . . . . .. . . 222
7.6 SummaryoftheChapter. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 224
References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225
8 ConcludingWords. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 227