Aggregation of LoD 1 building models as an optimization problem |
| |
Authors: | R. Guercke,T. Gö tzelmann |
| |
Affiliation: | a Leibniz Universität Hannover, Institute of Cartography and Geoinformatics, Appelstraße 9a, 30167 Hanover, Germanyb NAVIGON AG, Department of PreDevelopment, Berliner Platz 11, 97070 Würzburg, Germany |
| |
Abstract: | 3D city models offered by digital map providers typically consist of several thousands or even millions of individual buildings. Those buildings are usually generated in an automated fashion from high resolution cadastral and remote sensing data and can be very detailed. However, not in every application such a high degree of detail is desirable. One way to remove complexity is to aggregate individual buildings, simplify the ground plan and assign an appropriate average building height. This task is computationally complex because it includes the combinatorial optimization problem of determining which subset of the original set of buildings should best be aggregated to meet the demands of an application.In this article, we introduce approaches to express different aspects of the aggregation of LoD 1 building models in the form of Mixed Integer Programming (MIP) problems. The advantage of this approach is that for linear (and some quadratic) MIP problems, sophisticated software exists to find exact solutions (global optima) with reasonable effort. We also propose two different heuristic approaches based on the region growing strategy and evaluate their potential for optimization by comparing their performance to a MIP-based approach. |
| |
Keywords: | City models Generalization Aggregation Optimization |
本文献已被 ScienceDirect 等数据库收录! |
|