首页 | 本学科首页   官方微博 | 高级检索  
     检索      

三维非凸区域外包面的自动生成算法
引用本文:李世森,唐巾评,倪晓畅.三维非凸区域外包面的自动生成算法[J].水道港口,2013(6):542-546.
作者姓名:李世森  唐巾评  倪晓畅
作者单位:[1]天津大学水利工程仿真与安全国家重点实验室,天津300072 [2]天津大学仁爱学院,天津301636
摘    要:海岸工程的三维建模中一般需要根据已知散乱点集重构出计算模型的外包面。文章基于区域增长法,提出一种根据给定的三维散乱点集自动寻找其合适外包面的算法。该算法从随时改变着的局部入手,去寻找该局部区域凸包上的一个三角形,最后所有的三角形形成一个闭合的区域,即为整个区域外包面。局部的大小由事先设定的搜索点数控制。当点的布局较为合理,并且给定的全局搜索点数合适的情况下,算法可以较好地还原区域的外包面。

关 键 词:点集  外包面  非凸  算法

An automatic generation algorithm of 3-D non-convex region surface
LI Shi-sen,TANG Jin-ping,NI Xiao-chang.An automatic generation algorithm of 3-D non-convex region surface[J].Journal of Waterway and Harbour,2013(6):542-546.
Authors:LI Shi-sen  TANG Jin-ping  NI Xiao-chang
Institution:1.State Key Laboratory of Hydraulic Engineering Simulation and Safety, Tianjin University, Tianjin 300072,China; 2.Ren'ai College of Tianjin University, Tianjin 301636,China)
Abstract:In the mathematical model of coastal engineering, it is required to get the surface of the given points set. In this paper, based on the region growing method, an algorithm for automatic searching for the appropriate surface according to the given scattered points was presented. Beginning with the local region, the algorithm searches a triangle on the convex hull of the local region, and all of the triangles form a closed region, which is the surface of entire region. The size of local region is controlled by the number of searching points. When the distribution of points is reasonable, and the given global searching points are appropriate, the algorithm can restore the surface well.
Keywords:points set  surface  non-convex  algorithm
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号