%0 Journal Article
%T A Fast Progressive Surface Reconstruction Algorithm for Unorganized Points<br>散乱数据点的增量快速曲面重建算法
%A WANG Qing
%A WANG Rong-qing
%A BAO Hu-jun
%A PENG Qun-sheng
%A <br>王青
%A 王融清
%A 鲍虎军
%A 彭群生
%J 软件学报
%D 2000
%I 
%X A novel algorithm for fitting surface reconstruction of unorganized data points is presented in this paper. Since the local geometric and topological properties can be clearly described with its neighboring points for a given point, the algorithm takes full advantage of this fact to generate a local triangular mesh based on Delaunay triangulation technique in two dimensions. The main contribution of the proposed algorithm is to progressively integrate those local triangular meshes into a resulting mesh by deleting the illegal triangles. In addition, holes and gaps can be detected automatically during reconstruction, and the algorithm works well for models with arbitrary topology. Experimental results show that this algorithm is effective, robust and can be easily implemented.
%K Surface reconstruction
%K unorganized points
%K triangulation
%K two-dimensional manifold
%K geometric modeling<br>曲面重建
%K 散乱数据点
%K 三角剖分
%K 二维流形
%K 几何造型.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=35990EDC6A60AF07&yid=9806D0D4EAA9BED3&vid=708DD6B15D2464E8&iid=9CF7A0430CBB2DFD&sid=EC37857E7CB2811A&eid=8EC0A96FD5EC3019&journal_id=1000-9825&journal_name=软件学报&referenced_num=52&reference_num=16