#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2004

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kris Demarsin, Denis Vanderstraeten, Tim Volodine, Dirk Roose
- Computer-Aided Design
- 2007

The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point cloud that will define the border of the various surface patches. In this paper, we present an algorithm to extract closed sharp feature lines, which is necessary to create such a… (More)

The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point cloud that will define the border of the various surface patches. In this paper, we present an algorithm to extract closed sharp feature lines, which is necessary to create such a… (More)

- Tim Volodine, Denis Vanderstraeten, Dirk Roose
- GMP
- 2006

Recently, Sorkine et al. proposed a least squares based representation of meshes, which is suitable for compression and modeling. In this paper we look at this representation from the viewpoint of Tikhonov regularization. We show that this viewpoint yields a smoothing algorithm, which can be seen as an approximation of the shape using weighted geometry… (More)

- Tim Volodine, Michael S. Floater, Dirk Roose
- GRAPP
- 2007

We propose an algorithm which constructs an interpolating triangular mesh from a closed point cloud of arbitrary genus. The algorithm first constructs an intermediate structure called a Delaunay cover, which forms a barrier between the inside and the outside of the object. This structure is used to build a boolean voxel grid, with cells intersecting the… (More)

A method for constructing 3D triangulations of scanned 3D point data has been introduced by Floater et al.. First, a 2D parameterization of the points is computed and triangulated. The 3D triangulation is obtained directly from the 2D triangulation. This method requires an ordered boundary of the point cloud, and the computation of the 2D parameterization… (More)

We present a method to find closed feature lines which indicate sharp edges in a point cloud in the context of reverse engineering. We start with a first order segmentation which results in different point clusters. A weighted graph structure is built where vertices correspond to the resulting point clusters and edges connect neighboring clusters. By… (More)

A meshless method for parameterizing point clouds using convex combination mapping and mean value coordinates has been introduced by Floater et al. The advantage of the method is that only a sparse linear system has to be solved and the resulting parameterization is usually injective. However, in the presence of concave boundaries the convex combination… (More)

In this paper we propose a method for piecewise linear reconstruction and subsequent smoothing of a point sampled curve. The reconstruction step is based on the meshless parameterization reconstruction algorithm proposed by Floater. The information computed in the reconstruction step is used for a least squares based discrete smoothing method, with behavior… (More)

- ‹
- 1
- ›