A Blocking-Based Triangulation of a Surface Between Planar Contours
LI Deren · Systems engineering and electronics · 2003
Triangulation from a 3D-point set is one of the commonly used ways for restoring a 3D surface. However, in practice, it needs to process a huge amount of data, so it is time-consuming. Based on the fact that in 3D restoration most sequential section contours of an object are similar to adjacent ones, a quick method of triangulation between two section contours is proposed in this paper. First, the dominant points of every contour are located, then the dominant points of two contours are matched each other, thus the area between two contours is segmented into multiple smaller areas. And then triangulation is performed in each small area. Because the dominant points are pre-matched, a simple and quick triangulation can be applied. The strategy of triangulation used in this paper is to keep the proportion of the dots not used on two curves coincident with that of whole number of the dots on the two curves. Theoretical analysis and experiments show that this algorithm brings about a visual effect nearly the same as that of the conventional global optimizing methods, but spends much less time so it is effective.