Not checkedNot checked for notices yet.
A SWEEP-PLANE ALGORITHM FOR THE SIMPLIFICATION OF 3D BUILDING MODELS IN THE APPLICATION SCENARIO OF WIND SIMULATIONS
R. Piepereit, M. Deininger, M. Kada and 2 more
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences · 2018
doi:10.5194/isprs-archives-xlii-4-w10-151-2018 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
As the number of virtual 3D city models is steadily increasing, so are the possible applications that take advantage of them. 3D models can be used for applications that range from simple graphic visualizations to complex simulations, such as air flow and acoustic simulations. The geometric requirements needed for Computer Aided Engineering (CAE) and Computational Fluid Dynamics (CFD) increase the already very high complexity of processing 3D models. If there are too many small geometric details, mesh generation may fail. In addition it will create small grid cells that consequently lead to a high computation time. So far, the necessary simplifications have been performed in a time consuming manual process. To reduce the preprocessing time for the considered simulation topic, the simplifications and modifications have to be automated. In this paper we introduce a sweep-plane algorithm designed to automatically simplify virtual 3D models (e.g. CityGML) by removing geometry information unnecessary for numerical simulations. The algorithm will search for edges whose length does not reach a predefined threshold and dissolve them by sweeping nearby faces. As a result we obtain a simplified geometry that can be meshed properly. This algorithm serves as a general basis for the creation of future simplification algorithms that may even be applicable to any simulation necessary. For this paper, one of Stuttgart’s city blocks was processed with the developed algorithm and then used in a wind simulation carried out with ANSYS Fluent.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.