Generation of concise 3D building model from dense meshes by extracting and completing planar primitives

The generation of a concise building model has been and continues to be a challenge in photogrammetry and computer graphics. The current methods typically focus on the simplicity and fidelity of the model, but those methods either fail to preserve the structural information or suffer from low comput...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Photogrammetric record 2023-03, Vol.38 (181), p.22-46
Hauptverfasser: Liu, Xinyi, Zhu, Xianzhang, Zhang, Yongjun, Wang, Senyuan, Jia, Chen
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The generation of a concise building model has been and continues to be a challenge in photogrammetry and computer graphics. The current methods typically focus on the simplicity and fidelity of the model, but those methods either fail to preserve the structural information or suffer from low computational efficiency. In this paper, we propose a novel method to generate concise building models from dense meshes by extracting and completing the planar primitives of the building. From the perspective of probability, we first extract planar primitives from the input mesh and obtain the adjacency relationships between the primitives. Since primitive loss and structural defects are inevitable in practice, we employ a novel structural completion approach to eliminate linkage errors. Finally, the concise polygonal mesh is reconstructed by connectivity‐based primitive assembling. Our method is efficient and robust to various challenging data. Experiments on various building models revealed the efficacy and applicability of our method. This paper casts planar face subset extraction as a geometric rigidity measuring problem, which makes it capable of extracting accurate planar primitives without requiring pre‐setting threshold. A two‐stage gradual region growing algorithm is proposed to obtain accurate adjacency relationships between the primitives. This paper employs a novel structural completion approach to address the problem of primitive loss and structural defects.
ISSN:0031-868X
1477-9730
DOI:10.1111/phor.12438