Return to search

A Hybrid Hole-filling Algorithm

A polygon mesh, or a 3D mesh, consisting of a collection of vertices, edges, and polygons in three-dimensional space, is the standard way of representing 3D objects. In practice, polygon meshes acquired from the 3D scanning process fail to meet the quality requirements for most practical applications. Mesh defects like holes, duplicate elements, non-manifold elements are introduced during the scanning process, which lowers the quality of the output meshes. In this thesis, we describe a complete mesh-repairing process that fixes all defects within a polygon mesh. This process is divided into two parts: the mesh-cleaning part and the hole-filling part. In the mesh-cleaning part, we describe the ways of repairing different types of mesh defects. In the hole-filling part, we discuss two main hole-filling approaches: the surface-based method and the volumetric. In addition, we present a hybrid algorithm by combining the surface-based approach and the volumetric approach. We compare the meshes created by different hole-filing algorithms and show that the new algorithm is a good alternative to the existing ones. / Thesis (Master, Computing) -- Queen's University, 2013-09-11 23:45:08.591

Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OKQ.1974/8272
Date12 September 2013
CreatorsLong, Junhui
ContributorsQueen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.))
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
LanguageEnglish, English
Detected LanguageEnglish
TypeThesis
RightsThis publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner.
RelationCanadian theses

Page generated in 0.0023 seconds