AbstractWe consider the problem of discovering a smooth unknown surface S bounding an object O in R3. The discovery process consists of moving a point probing device in the free space around O so that it repeatedly comes in contact with S. We propose a probing strategy for generating a sequence of surface samples on S from which a triangulated surface can be generated that approximates S within any desired accuracy. We bound the number of probes and the number of elementary moves of the probing device. Our solution is an extension of previous work on Delaunay refinement techniques for surface meshing. The approximating surface we generate enjoys the many nice properties of the meshes obtained by those techniques, e.g. exact topological type...
For a surface F in 3-space that is represented by a set S of sample points, we construct a coarse ap...
For a surface F in 3-space that is represented by a set S of sample points, we construct a coarse ap...
Manifold triangulation is the problem of, given a set of points $V$ sampled densely from some known ...
AbstractWe consider the problem of discovering a smooth unknown surface S bounding an object O in R3...
We consider the problem of discovering a smooth unknown surface S bounding an object O in R 3. The d...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point...
We present a practical reconstruction algorithm that generates a surface triangulation from an input...
The notion of ε-sample, introduced by Amenta and Bern, has proven to be a key concept in the theory ...
A surface reconstruction algorithm takes as input a set of sample points from an unknown closed and ...
A surface reconstruction algorithm takes as input a set of sample points from an unknown closed and ...
Surface mesh generation through Delaunay refinement is considered as a relevant alternative to the c...
We describe and demonstrate an algorithm that takes as input an unorganized set of points {x1, ..., ...
AbstractIn this paper, the problem of reconstructing a surface, given a set of scattered data points...
This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth su...
Surface mesh generation through Delaunay refinement is considered as a relevant alternative to the c...
For a surface F in 3-space that is represented by a set S of sample points, we construct a coarse ap...
For a surface F in 3-space that is represented by a set S of sample points, we construct a coarse ap...
Manifold triangulation is the problem of, given a set of points $V$ sampled densely from some known ...
AbstractWe consider the problem of discovering a smooth unknown surface S bounding an object O in R3...
We consider the problem of discovering a smooth unknown surface S bounding an object O in R 3. The d...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point...
We present a practical reconstruction algorithm that generates a surface triangulation from an input...
The notion of ε-sample, introduced by Amenta and Bern, has proven to be a key concept in the theory ...
A surface reconstruction algorithm takes as input a set of sample points from an unknown closed and ...
A surface reconstruction algorithm takes as input a set of sample points from an unknown closed and ...
Surface mesh generation through Delaunay refinement is considered as a relevant alternative to the c...
We describe and demonstrate an algorithm that takes as input an unorganized set of points {x1, ..., ...
AbstractIn this paper, the problem of reconstructing a surface, given a set of scattered data points...
This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth su...
Surface mesh generation through Delaunay refinement is considered as a relevant alternative to the c...
For a surface F in 3-space that is represented by a set S of sample points, we construct a coarse ap...
For a surface F in 3-space that is represented by a set S of sample points, we construct a coarse ap...
Manifold triangulation is the problem of, given a set of points $V$ sampled densely from some known ...