The topological holes left over by lattice vertex deletion are patched by local triangulation.
删除网格顶点而产生的“拓扑洞”由局部三角化来修补。
In contrast with the local triangulation algorithm, the algorithm in this paper is more powerful to avoid surface self intersection.
与基于中轴的三角剖分算法相比，该文算法需要更少和更简单的计算。
This paper presents a Local Information Based Region-Growing (LIBRG) algorithm, which is supposed to solve the problems of surface triangulation reconstruction from scattered points.
本文提出了一种基于局部信息的区域扩张算法(LIBRG)，用以解决由离散点云重构三角网格面的问题。
This paper presents a Local Information Based Region-Growing (LIBRG) algorithm, which is supposed to solve the problems of surface triangulation reconstruction from scattered points.
本文提出了一种基于局部信息的区域扩张算法(LIBRG)，用以解决由离散点云重构三角网格面的问题。
应用推荐