A Hole-filling Algorithm Using Non-uniform Rational B-splines

Kumar, Amitesh; Shih, Alan M.; Ito, Yasushi; Ross, Douglas H.; Soni, Bharat K.

doi:10.1007/978-3-540-75103-8_10

Cited by 13 publications

(16 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…7. A recent method described by Kumar and Shih (2012) extends the algorithm of Kumar et al (2007) (Section 3). Here a hybrid approach surface and volume based technique is proposed.…”

Section: Methods Based On Signed Distance Functions and Volumetric Rementioning

confidence: 99%

“…The works of Kumar et al (2007) and Li et al (2010) are two representative examples in which this kind of solution is applied.…”

Section: Methods Based On Parametric Representationsmentioning

confidence: 99%

“…The method by Kumar et al (2007) begins by closing the hole with a triangular mesh. This initial connectivity is kept by points until the end of the process.…”

Section: Methods Based On Parametric Representationsmentioning

confidence: 99%

“…Here a hybrid approach surface and volume based technique is proposed. First, the surface based technique of Kumar et al (2007) is applied and then the resulting surface mesh is converted into a volumetric representation. For simplicity, the proposal uses a Cartesian grid to represent the data.…”

Section: Methods Based On Signed Distance Functions and Volumetric Rementioning

confidence: 99%

See 3 more Smart Citations

A comparison of hole-filling methods in 3D

Tejado

Salamanca

Merchán

et al. 2016

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

This paper presents a review of the most relevant current techniques that deal with hole-filling in 3D models. Contrary to earlier reports, which approach mesh repairing in a sparse and global manner, the objective of this review is twofold. First, a specific and comprehensive review of hole-filling techniques (as a relevant part in the field of mesh repairing) is carried out. We present a brief summary of each technique with attention paid to its algorithmic essence, main contributions and limitations. Second, a solid comparison between 34 methods is established. To do this, we define 19 possible meaningful features and properties that can be found in a generic hole-filling process. Then, we use these features to assess the virtues and deficiencies of the method and to build comparative tables. The purpose of this review is to make a comparative hole-filling state-of-the-art available to researchers, showing pros and cons in a common framework.

show abstract

“…7. A recent method described by Kumar and Shih (2012) extends the algorithm of Kumar et al (2007) (Section 3). Here a hybrid approach surface and volume based technique is proposed.…”

Section: Methods Based On Signed Distance Functions and Volumetric Rementioning

confidence: 99%

“…The works of Kumar et al (2007) and Li et al (2010) are two representative examples in which this kind of solution is applied.…”

Section: Methods Based On Parametric Representationsmentioning

confidence: 99%

“…The method by Kumar et al (2007) begins by closing the hole with a triangular mesh. This initial connectivity is kept by points until the end of the process.…”

Section: Methods Based On Parametric Representationsmentioning

confidence: 99%

Section: Methods Based On Signed Distance Functions and Volumetric Rementioning

confidence: 99%

See 2 more Smart Citations

A comparison of hole-filling methods in 3D

Tejado

Salamanca

Merchán

et al. 2016

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

show abstract

“…A similar approach was adopted by Levy [50], who triangulated the hole in a 2D parametric domain but faired the triangulation in 3D using a minimal energy surface functional. In the second direction, the smooth hole-filling patch is obtained by adapting scattered data fitting techniques, such as Moving Least Squares [87,80], Radial Basis Functions [22,27], and NURBS fitting [49], to fit the geometry surrounding the hole. A similar approach was taken by Jia and Tang [39], who completed the missing geometry by a tensor voting process guided by the normal directions of nearby polygons.…”

Section: Filling Holesmentioning

confidence: 99%

Fixing Geometric Errors on Polygonal Models: A Survey

2009

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Polygonal models are popular representations of 3D objects. The use of polygonal models in computational applications often requires a model to properly bound a 3D solid. That is, the polygonal model needs to be closed, manifold, and free of self-intersections. This paper surveys a sizeable literature for repairing models that do not satisfy this criteria, focusing on categorizing them by their methodology and capability. We hope to offer pointers to further readings for researchers and practitioners, and suggestions of promising directions for future research endeavors.

show abstract

A CAE-oriented mesh hole-filling algorithm focusing on geometry and quality

Hai

Guo

Dong

2022

View full text Add to dashboard Cite

PurposeIntegrality of surface mesh is requisite for computational engineering. Nonwatertight meshes with holes can bring inconvenience to applications. Unlike simple modeling or visualization, the downstream industrial application scenarios put forward higher requirements for hole-filling, although many related algorithms have been developed. This study aims at the hole-filling issue in industrial application scenarios.Design/methodology/approachThis algorithm overcomes some inherent weakness of general methods and generates a high-level resulting mesh. Initially, the primitive hole boundary is filled with a more appropriate triangulation which introduces fewer geometric errors. And in order for better performances on shape approximation of the background mesh, the algorithm also refines the initial triangulation with topology optimization. When obtaining the background mesh defining the geometry and size field, spheres on it are packed to determine the vertex configuration and then the resulting high-level mesh is generated.FindingsThrough emphasizing geometry recovery and mesh quality, the proposed algorithm works well in hole-filling in industrial application scenarios. Many experimental results demonstrate the reliability and the performance of the algorithm. And the processed meshes are capable of being used for industrial simulation computations directly.Originality/valueThis paper makes input meshes more adaptable for solving programs through local modifications on meshes and perfects the preprocessing technology of finite element analysis (FEA).

show abstract

A Hole-filling Algorithm Using Non-uniform Rational B-splines

Cited by 13 publications

References 10 publications

A comparison of hole-filling methods in 3D

A comparison of hole-filling methods in 3D

Fixing Geometric Errors on Polygonal Models: A Survey

A CAE-oriented mesh hole-filling algorithm focusing on geometry and quality

Contact Info

Product

Resources

About