Generalisation and Multiple Representation

Generalisation models and processes

6104.2 - Using the A* Algorithm to Find Optimal Sequences for Area Aggregation

Thursday, July 6
8:50 AM - 9:10 AM
Location: Virginia B

Given two land-cover maps of different
scales, we wish to find a sequence of small incremental
changes that gradually transforms one map into the other.
We assume that the two input maps consist of
polygons that constitute a planar subdivision and belong to
different land-cover classes. Every polygon in the small-scale map
is the union of a set of polygons in the large-scale map. In each
step of the sequence that we compute, the smallest area in the
current map is merged with one of its neighbors. We do not select
that neighbor according to a prescribed rule but define the
whole
sequence of pairwise merges at once, based on global
optimization. An important requirement for such a method is a
formalization of the problem in terms of optimization objectives and
constraints, which we present together with a solution that is based
on the algorithm A*. This algorithm allows us to limit the
exploration of the search space such that we can compute
solutions of high quality in reasonable time. We tested the method with a
dataset of the official German topographic database ATKIS and
discuss our results.

Dongliang Peng

PhD candidate
Chair of Computer Science I, University of Würzburg

Dongliang Peng received a bachelor degree in Mapping Engineering and a master degree in Cartography and GIS from Central South University, China. He is currently a PhD student at the Chair of Computer Science I, University of Würzburg. His research focuses on continuous map generalization, optimization algorithms, and morphing algorithms.

Presentation(s):

Send Email for Dongliang Peng

Alexander Wolff

Professor
Chair of Computer Science I, University of Würzburg

since 2015:
dean of the Faculty of Mathematics and Computer Science, University of Würzburg
2013–2015:
vice dean of the Faculty of Mathematics and Computer Science, University of Würzburg
2011–2013:
managing director of the Institute of Computer Science, University of Würzburg
since 2009:
chair of Efficient Algorithms and Knowledge Based Systems at the Institute of Computer Science, University of Würzburg

Presentation(s):

Send Email for Alexander Wolff

Jan-Henrik Haunert

Chair of Geoinformation, University of Bonn

seit 08/2016: Professor für Geoinformation am Institut für Geodäsie und Geoinformation an der Universität Bonn
09/2013 bis 07/2016: Professor für Geoinformatik an der Universität Osnabrück
09/2009 bis 08/2013: Akademischer Rat am Lehrstuhl für Informatik I der Universität Würzburg, Abschluss der Habilitation im Fach Informatik (Juli 2013)
01/2004 bis 08/2009: Wissenschaftlicher Mitarbeiter am Institut für Kartographie und Geoinformatik der Universität Hannover, Abschluss der Promotion "mit Auszeichnung" im Fach Geodäsie und Geoinformatik (September 2008)
10/1998 bis 12/2003: Studium der Geodäsie und Geoinformatik an der Universität Hannover, Auslandssemester an der Helsinki University of Technology, wissenschaftliche Hilfskraft am Institut für Photogrammetrie und GeoInformation in Hannover, Abschluss als Dipl.-Ing. "mit Auszeichnung"

Presentation(s):

Send Email for Jan-Henrik Haunert

Cécile Duchêne

Senior Researcher
IGN France, LASTIG, COGIT team

Cécile Duchêne is a senior researcher at the LASTIG laboratory, COGIT team, IGN France (the French National Mapping Agency). She holds a PhD in computer science from University Pierre et Marie Curie (Paris 6) and an Habilitation from University Paris-Est. She has been the vice-chair of the ICA Commission on Generalisation and Multiple Representation since 2011. Her research interests are in automated spatial analysis and automated cartography, especially automated cartographic generalization.

Presentation(s):

Send Email for Cécile Duchêne


Assets

6104.2 - Using the A* Algorithm to Find Optimal Sequences for Area Aggregation

Slides Handout

Attendees who have favorited this

Please enter your access key

The asset you are trying to access is locked. Please enter your access key to unlock.

Send Email for Using the A* Algorithm to Find Optimal Sequences for Area Aggregation