Aggregation of LoD 1 building models as an optimization problem

摘要: Abstract 3D city models offered by digital map providers typically consist of several thousands or even millions individual buildings. Those buildings are usually generated in an automated fashion from high resolution cadastral and remote sensing data can be very detailed. However, not every application such a degree detail is desirable. One way to remove complexity aggregate buildings, simplify the ground plan assign appropriate average building height. This task computationally complex because it includes combinatorial optimization problem determining which subset original set should best aggregated meet demands application. In this article, we introduce approaches express different aspects aggregation LoD 1 form Mixed Integer Programming (MIP) problems. The advantage approach that for linear (and some quadratic) MIP problems, sophisticated software exists find exact solutions (global optima) with reasonable effort. We also propose two heuristic based on region growing strategy evaluate their potential comparing performance MIP-based approach.