We describe and demonstrate an algorithm that takes as input an unorganized set of points
{xl,.... xn}⊂ R3 on or near an unknown manifold M, and produces as output a simplicial …

We present an algorithm to approximate a set of unorganized points with a simple curve
without self-intersections. The moving least-squares method has a good ability to reduce a …

Beginning with digitized volumetric data, we wish to rapidly and efficiently extract and
represent surfaces defined as isosurfaces in the interpolated data. The Marching Cubes …

Many advances have been made in stereo-vision-based tube measurement. This approach
is characterised by its accuracy, level of automation, non-contact nature, reliability, simplicity …

We present an algorithm to reconstruct a collection of disjoint smooth closed curves from n
noisy samples. Our noise model assumes that the samples are obtained by first drawing …

Curve reconstruction that generates a piece of centric curve from a piece of planar strip-
shaped point cloud is a fundamental problem in reverse engineering. In this paper, we …

The signed distance field of a surface can effectively support many geometry processing
tasks such as decimation, smoothing, and Boolean operations since it provides efficient …

In this paper, a robust algorithm is proposed for reconstructing 2D curve from unorganized
point data with a high level of noise and outliers. By constructing the quadtree of the input …

Ring forgings are widely used in industrial fields. It is an important way that the key
dimensions of ring forgings are obtained by laser scanning to ensure the processing quality …

We present a method to estimate the in/out function of a closed surface represented by an
unorganized set of data points. From the in/out function, we compute an approximation of the …