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 R3. 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
Delaunay refinement is a mesh generation paradigm noted for offering theoretical guarantees regardin...
We present an algorithm and its implementation to reconstruct a complex composed of surfaces from an...
We present a method for solving the following problem: Given a set of data points scattered in three...
We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled ...
We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled ...
The presence of holes in a triangle mesh is classically ascribed to the de ciencies of the point clo...
The raw 3D mesh models usually contain some holes and cracks, which are obstacles for subsequent geo...
In the last few years, several techniques to fill holes of a given surface by means of minimal energ...
We show how to triangulate a three dimensional polyhedral region with holes. Our triangulation is op...
We describe a method for filling holes in unstructured triangular meshes. The resulting patching mes...
The 3D models obtained from the 3D scanners are often noisy and have flaws such as gaps, holes, self...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point...
AbstractDelaunay refinement is a technique for generating unstructured meshes of triangles for use i...
We present a simple and fast algorithm for computing the exact holes in discrete two-dimensional man...
We study several versions of the problem of generating triangular meshes for finite element methods....
Delaunay refinement is a mesh generation paradigm noted for offering theoretical guarantees regardin...
We present an algorithm and its implementation to reconstruct a complex composed of surfaces from an...
We present a method for solving the following problem: Given a set of data points scattered in three...
We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled ...
We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled ...
The presence of holes in a triangle mesh is classically ascribed to the de ciencies of the point clo...
The raw 3D mesh models usually contain some holes and cracks, which are obstacles for subsequent geo...
In the last few years, several techniques to fill holes of a given surface by means of minimal energ...
We show how to triangulate a three dimensional polyhedral region with holes. Our triangulation is op...
We describe a method for filling holes in unstructured triangular meshes. The resulting patching mes...
The 3D models obtained from the 3D scanners are often noisy and have flaws such as gaps, holes, self...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point...
AbstractDelaunay refinement is a technique for generating unstructured meshes of triangles for use i...
We present a simple and fast algorithm for computing the exact holes in discrete two-dimensional man...
We study several versions of the problem of generating triangular meshes for finite element methods....
Delaunay refinement is a mesh generation paradigm noted for offering theoretical guarantees regardin...
We present an algorithm and its implementation to reconstruct a complex composed of surfaces from an...
We present a method for solving the following problem: Given a set of data points scattered in three...