無序性三維點資料之網格化曲面重建

Abstract

無序性三維點資料，意指僅具有三維座標而無其它額外資訊的點資料。本論文將依此僅有的條件來完成其網格曲面的重建。 為了使網格曲面能呈現模型原貌，則需要大量的點資料，這使得在計算上非常耗時且有較高的複雜度。本研究以區域性處理的方式來建構網格曲面，藉由鄰近點集合的建立，來增進建立網格的效率，並能維持點資料的區域性特徵。 網格建立後，並非全部是用來作為網格曲面，因為有多餘網格的存在。多餘網格會增加網格曲面的資料量、影嚮後續的處理以及網格曲面無法應用於製造上。本研究於重建的演算法中加入刪除多餘網格的準則來避免這個現象。Unorganized three-dimensional points means that the points contain no additional information other than the three-dimensional coordinates. In this dissertation, the reconstruction of polygonal surface will be implemented with the only condition “three-dimensional coordinates.” For presenting whole model with polygonal surface, it is needed to have a flock of points. The large quantity of points in computing cost much time and have higher complexity. In this research, a method is presented with regional process to reconstruct the polygonal surface. The efficiency of building polygons is improved and the local feature of point is reserved by building neighbor points set. After building polygons, all the polygons are not used to form the polygonal surface because many unnecessary polygons exist. That will enlarge the data of polygonal surface, affect the follow-up processes and cause the polygonal surface not useful in manufacturing. In the research, the algorithm of reconstruction is added the rules to delete the unnecessary polygons.