摘要
海岸工程的三维建模中一般需要根据已知散乱点集重构出计算模型的外包面。文章基于区域增长法,提出一种根据给定的三维散乱点集自动寻找其合适外包面的算法。该算法从随时改变着的局部入手,去寻找该局部区域凸包上的一个三角形,最后所有的三角形形成一个闭合的区域,即为整个区域外包面。局部的大小由事先设定的搜索点数控制。当点的布局较为合理,并且给定的全局搜索点数合适的情况下,算法可以较好地还原区域的外包面。
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.
出处
《水道港口》
2013年第6期542-546,共5页
Journal of Waterway and Harbor
关键词
点集
外包面
非凸
算法
points set
surface
non-convex
algorithm
