The topological holes left over by lattice vertex deletion are patched by localtriangulation.
删除网格顶点而产生的“拓扑洞”由局部三角化来修补。
2
In contrast with the localtriangulation algorithm, the algorithm in this paper is more powerful to avoid surface self intersection.
与基于中轴的三角剖分算法相比，该文算法需要更少和更简单的计算。
3
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.