Automatic Hole-Filling of Triangular Meshes Using Local Radial Basis Function

Branch, John W.; Prieto, Flavio; Boulanger, Pierre

doi:10.1109/3dpvt.2006.33

Cited by 30 publications

(14 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There the mesh provides additional information, including normals. Scattered data interpolation approaches [Tekumalla and Cohen 2004;Brazil et al 2010;Branch et al 2006;Podolak and Rusinkiewicz 2005] require normals or existing surfaces. The volumetric approaches [Brazil et al 2010;Podolak and Rusinkiewicz 2005] can fill complex holes, but assume that the desired result is a watertight mesh, which is not always true in our case.…”

Section: Related Workmentioning

confidence: 99%

Surface patches for 3D sketching

Abbasinejad

Joshi

Grimm

et al. 2013

Proceedings of the International Symposium on Sketch-Based Interfaces and Modeling

View full text Add to dashboard Cite

Figure 1: The 3D sketch on the left implies a surface consisting of eight patches, four of which are complex and highly non-planar. Our system automatically divides these complex patches into smaller ones that are simpler and therefore easier to tessellate (middle). Displaying the simplified patches (right) during interactive sketching can both improve visualization and provide new opportunities for natural interaction, such as sketching on the resulting patches. Abstract3D sketching is an appealing approach for creating concept shapes in the early stages of design. While curve networks alone can convey shape, surfacing the network can dramatically help with visualization and interaction. Unfortunately, surfacing a curve network is an inherently ambiguous problem, and even if the correct surface patches are identified, they can have an arbitrarily complex 3D geometry, making it challenging to produce a reasonable tessellation. In this paper we address the problem of creating light-weight surface tessellations on the fly. Our approach is to identify potential patches in the curve network, and then break complicated patches into simpler ones which can be tessellated using any simple algorithm. Our surfacing approach relies on the observation that breaking a complicated patch into a set of nearly planar ones with small total area seems to create a simple, natural-looking surfaces. We demonstrate our approach on curve networks generated by two different 3D sketching systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Surface patches for 3D sketching

Abbasinejad

Joshi

Grimm

et al. 2013

Proceedings of the International Symposium on Sketch-Based Interfaces and Modeling

View full text Add to dashboard Cite

show abstract

“…Diferentes trabajos describen diversas técnicas para la identificación de discontinuidades sobre mallas triangulares [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. El procedimiento más sencillo y funcional con gran facilidad de implementación lo constituye el propuesto por [17].…”

Section: Extracción De Contornos Y Estimación De Características Geomunclassified

Análisis del comportamiento de las propiedades geométricas de los contornos de huecos en nubes de puntos

Narváez¹

2014

prospect

View full text Add to dashboard Cite

Análisis del comportamiento de las propiedades geométricas de los contornos de huecos en nubes de puntos Análisis del comportamiento de las propiedades geométricas de los contornos de huecos en nubes de puntos RESUMENEste trabajo está relacionado con las anomalías representadas por discontinuidades o huecos presentes en nubes de puntos tridimensionales. Las auto-oclusiones y las propiedades ópticas del material del objeto sensado constituyen las fuentes principales de anomalías. El presente estudio fue realizado con el propósito de analizar similitudes o disimilitudes estadísticas de las propiedades geométricas de los contornos generados por estas dos fuentes. Las propiedades analizadas fueron la estimación de la curvatura y la torsión, para esto se clasificaron los diferentes contornos en dos grupos: los generados por propiedades ópticas del material del objeto y los generados por oclusión. Los resultados sugieren que estas fuentes generan contornos de discontinuidades estadísticamente similares, dificultando una discriminación basada en estas propiedades.Palabras clave: Curvatura, Llenado de huecos, Oclusiones, Reconstrucción de superficies, Torsión. ABSTRACTThis work is related to anomalies characterized by discontinuities called holes on three-dimensional cloud of points. The self-occlusions and optical properties of scanned objects are the main source generating anomalies. The present study is making in order to analyze statistical similarities and dissimilarities of geometrical properties of contour generated by these sources. The analyzed properties were the curvature and torsion estimations, for this, each one of contours was classified into two groups: those generated by optical properties and those generated by occlusion. The results suggest those sources generate similar statistical holes, making it difficult to make a discrimination based on these properties.

show abstract

“…Hence, the complexity of the algorithm is a function of n. That is, in cases where the surface is large and the hole boundary is small, the algorithm is inefficient. To overcome this problem, Branch et al [3] extend this approach to use local RBF for each hole. Chen et al [5] use an RBFbased approach to fill holes and recover sharp features in the hole area.…”

Section: Related Workmentioning

confidence: 99%

Filling holes in triangular meshes by curve unfolding

Brunton

Wuhrer

Shu

et al. 2009

2009 IEEE International Conference on Shape Modeling and Applications

View full text Add to dashboard Cite

Abstract-We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled using a minimum energy surface that is obtained in three steps. First, we unfold the hole boundary onto a plane using energy minimization. Second, we triangulate the unfolded hole using a constrained Delaunay triangulation. Third, we embed the triangular mesh as a minimum energy surface in R 3 . The running time of the method depends primarily on the size of the hole boundary and not on the size of the model, thereby making the method applicable to large models. Our experiments demonstrate the applicability of the algorithm to the problem of filling holes bounded by highly curved boundaries in large models.

show abstract

Automatic Hole-Filling of Triangular Meshes Using Local Radial Basis Function

Cited by 30 publications

References 22 publications

Surface patches for 3D sketching

Surface patches for 3D sketching

Análisis del comportamiento de las propiedades geométricas de los contornos de huecos en nubes de puntos

Filling holes in triangular meshes by curve unfolding

Contact Info

Product

Resources

About