کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
441803 | 691946 | 2013 | 13 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Rule-based method for automatic scaffold assembly from 3D building models Rule-based method for automatic scaffold assembly from 3D building models](/preview/png/441803.png)
To manually specify an optimal scaffold assembly for a given building geometry is a time consuming task. Our goal is to automate the process of selecting and placing scaffold components in order to design an optimal scaffold assembly for a specific building. The resulting assembly must be possible to construct in practice, should be practical to use for the workers, must satisfy governmental rules and regulations and should ideally result in minimum accumulated component cost. We propose a novel procedural modeling pipeline based on an input house model. First we extract vital coordinates from the house model that define the 3D scaffold placement. These coordinates are the basis for defining the positioning of scaffold cells. In the next step we populate the cells with actual scaffold components geometry. The resulting model is visualized to assist the assembly process. Additionally it is decomposed into elementary building blocks to produce assembly component lists to estimate the scaffold cost estimates, compute the weight for transportation and packing of components from a warehouse. The result from the automated process is compared to scaffold design produced manually by a professional scaffold designer.
Figure optionsDownload high-quality image (236 K)Download as PowerPoint slideHighlights
► Rapid creation/import of buildings together with surrounding terrain.
► Algorithm for automatic detection of facades.
► Algorithm for automatic generation of scaffold design for selected facades that comply with constraining rules and optimized for minimal cost.
► Visual and quantitative representation of the scaffold design.
Journal: Computers & Graphics - Volume 37, Issue 4, June 2013, Pages 256–268