یک الگوریتم پر کردن سوراخ تکه ای در مهندسی معکوس
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|52664||2005||8 صفحه PDF||سفارش دهید||3780 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Computer-Aided Design, Volume 37, Issue 2, February 2005, Pages 263–270
While scanning a complex part in reverse engineering, it is not possible to acquire all part of the scanned surface. Data are inevitably missing due to the complexity of the scanned part or imperfect scanning process. Missing scanned data cause holes in the created triangular mesh, so that a hole-free mesh model is prerequisite for fitting watertight surfaces. Although a number of hole filling algorithms have been investigated, they enable to fill holes only on the smooth regions of a model. They are not always robust in the regions of high curvature. This paper proposes a novel methodology that can automatically fill complex polygonal holes with a piecewise manner. It incrementally splits a complex hole into several simple holes with respect to the 3D shape of the hole boundary, and then it consecutively fills each divided simple hole with planar triangulation method until the entire complex hole is firmly closed. Finally smoothing and subdivision techniques are applied for enhancing the hole triangles. The newly created vertices and triangles are added to their respective lists and the topology information is updated. The method has proven to be robust and effective from the result of test with a variety of complex holes. Examples are given and discussed to validate the methodology.