基于离散化的复杂曲面建筑网格划分方法  

Grid Generation Method for Complex Surface Buildings by Discretization

作　　者：李铁瑞[1] 吴慧 王奇胜[1] 高博青[1] LI Tierui;WU Hui;WANG Qisheng;GAO Boqing(College of Civil Engineering and Architecture,Zhejiang University,Hangzhou 310058,China;College of Public Administration,Zhejiang University of Finance ＆ Economics,Hangzhou 310018,China)

机构地区：[1]浙江大学建筑工程学院,浙江杭州310058 [2]浙江财经大学公共管理学院,浙江杭州310018

出　　处：《湖南大学学报（自然科学版）》2018年第7期48-53,共6页Journal of Hunan University:Natural Sciences

基　　金：国家自然科学基金资助项目(51378457;51678521)~~

摘　　要：为实现存在裁剪、孔洞的复杂自由曲面建筑网格划分,提出了一种基于离散的、以均匀性为目标的划分方法.将复杂曲面离散并缝合,形成由大量面片组成的离散曲面,作为多个参数曲面的一体化表示.采用改进的误差扩散算法,在离散曲面上按一定的密度进行初始布点.采用基于空间距离的粒子动力松弛算法对点云进行初步均匀化,并应用基于曲面距离的k均值算法进行再次均匀化.对均匀的点云求曲面距离的Voronoi图,并获得相应网格.对网格进行拓扑优化和光顺优化.算例表明,本文算法可有效处理存在裁剪、孔洞的复杂自由曲面,并得到均匀光顺的三角网格.A grid generation method for complicated multiple surfaces with trimmings and holes is presented. This method is based on the discretization and concentrates on the aim of homogeneity. The multiple surfaces are discretized separately and seamed together to achieve a discrete surface. The points are distributed on the discrete surface according to the density applying improved error-diffusion method. The points are homogenized by particle dynamics method with Euclid distance and then homogenized once more by k-means algorithm with surface distance. The Voronoi diagram with surface distance is delivered on the discrete surface to obtain the grids. The topological and smooth relaxations are applied on the grids. Eventually, the case study indicates that this method can solve the problem of grid generation for complicated multiple surfaces effectively and achieve the homogeneous and smooth grids.

关 键 词：复杂曲面 离散化 网格划分 均匀化 松弛 

分 类 号：TU311.41[建筑科学—结构工程]