%0 Conference Paper %1 haunert2007 %A Haunert, J.-H. %B Proceedings of the 23rd International Cartographic Conference (ICC'07), August 4--10, 2007, Moscow, Russia %D 2007 %K aggregation map_generalization simulated_annealing quality optimization myown integer_programming %T Optimization methods for area aggregation in land cover maps %X The aggregation of areas is an important subproblem of the map generalization task. Especially, it is relevant for the generalization of topographic maps which contain areas of different land cover, such as settlement, water, or different kinds of vegetation. An existing approach is to apply algorithms that iteratively merge adjacent areas, taking only local measures into consideration. In contrast, global optimization methods are proposed in this paper to derive maps of higher quality. Given a planar subdivision in which each area is assigned to a land cover class, we consider the problem of aggregating areas such that defined thresholds are satisfied. The aggregation is directed at two objectives: Classes of areas shall change as little as possible and compact shapes are preferred. In this paper, the problem is formalized and two different approaches are compared, namely mixed-integer programming and simulated annealing.

@inproceedings{haunert2007, abstract = {The aggregation of areas is an important subproblem of the map generalization task. Especially, it is relevant for the generalization of topographic maps which contain areas of different land cover, such as settlement, water, or different kinds of vegetation. An existing approach is to apply algorithms that iteratively merge adjacent areas, taking only local measures into consideration. In contrast, global optimization methods are proposed in this paper to derive maps of higher quality. Given a planar subdivision in which each area is assigned to a land cover class, we consider the problem of aggregating areas such that defined thresholds are satisfied. The aggregation is directed at two objectives: Classes of areas shall change as little as possible and compact shapes are preferred. In this paper, the problem is formalized and two different approaches are compared, namely mixed-integer programming and simulated annealing.}, added-at = {2011-11-07T12:01:01.000+0100}, author = {Haunert, J.-H.}, biburl = {https://www.bibsonomy.org/bibtex/21502f67279e4f63e6a54bbdf9b19a75f/haunert}, booktitle = {Proceedings of the 23rd International Cartographic Conference (ICC'07), August 4--10, 2007, Moscow, Russia}, interhash = {b84c96da4537f39b5b721877c0b60a3e}, intrahash = {1502f67279e4f63e6a54bbdf9b19a75f}, keywords = {aggregation map_generalization simulated_annealing quality optimization myown integer_programming}, pdf = {http://www1.informatik.uni-wuerzburg.de/pub/haunert/pdf/HaunertICC07.pdf}, timestamp = {2011-11-07T12:01:01.000+0100}, title = {Optimization methods for area aggregation in land cover maps}, year = 2007 }