Results 1  10
of
1,600
Experiments on Curve Reconstruction
 In Proc. 2nd Workshop Algorithm Eng. Exper
, 2000
"... this paper we describe a testbed for curve reconstruction algorithms and report about an experimental evaluation of the curve reconstruction algorithms of Amenta, Bern, and Eppstein (ABE), Dey and Kumar (DK), Gold (Gold), Dey, Mehlhorn, and Ramos (DMR), and the TSPalgorithm. We also report about ex ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
this paper we describe a testbed for curve reconstruction algorithms and report about an experimental evaluation of the curve reconstruction algorithms of Amenta, Bern, and Eppstein (ABE), Dey and Kumar (DK), Gold (Gold), Dey, Mehlhorn, and Ramos (DMR), and the TSPalgorithm. We also report about
Curve reconstruction from unorganized points
 Computer Aided Geometric Design
, 2000
"... We present an algorithm to approximate a set of unorganized points with a simple curve without selfintersections. The moving leastsquares method has a good ability to reduce a point cloud to a thin curvelike shape which is a nearbest approximation of the point set. In this paper, an improved mov ..."
Abstract

Cited by 67 (3 self)
 Add to MetaCart
moving leastsquares technique is suggested using Euclidean minimum spanning tree, region expansion and refining iteration. After thinning a given point cloud using the improved moving leastsquares technique we can easily reconstruct a smooth curve. As an application, a pipe surface reconstruction
A Simple Provable Algorithm for Curve Reconstruction
, 1998
"... We present an algorithm that provably reconstructs a curve in the framework introduced by Amenta, Bern and Eppstein. The highlights of the algorithm are: (i) it is simple, (ii) it requires a sampling density better than previously known, (iii) it can be adapted for curve reconstruction in higher dim ..."
Abstract

Cited by 53 (12 self)
 Add to MetaCart
We present an algorithm that provably reconstructs a curve in the framework introduced by Amenta, Bern and Eppstein. The highlights of the algorithm are: (i) it is simple, (ii) it requires a sampling density better than previously known, (iii) it can be adapted for curve reconstruction in higher
Analysis of Curve Reconstruction by Meshless Parameterization
 Numerical Algorithms
, 2003
"... Abstract: This paper proposes and analyzes a method called meshless parameterization for reconstructing curves from unordered point samples. The method solves a linear system of equations based on convex combinations so as to map the sampled points into corresponding parameter values, whose natural ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: This paper proposes and analyzes a method called meshless parameterization for reconstructing curves from unordered point samples. The method solves a linear system of equations based on convex combinations so as to map the sampled points into corresponding parameter values, whose natural
Curve Reconstruction: Connecting Dots with Good Reason
 IN PROC. 15TH ANNU. ACM SYMPOS. COMPUT. GEOM
, 1999
"... Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers present algorithms that come with a guarantee: Given a suciently dense sample of a closed smooth curve, the algorithms construct the correct polygonal reconstruction. Nothing is claimed about the ..."
Abstract

Cited by 52 (8 self)
 Add to MetaCart
Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers present algorithms that come with a guarantee: Given a suciently dense sample of a closed smooth curve, the algorithms construct the correct polygonal reconstruction. Nothing is claimed about
TSPBased Curve Reconstruction in Polynomial Time
 PROC. ACMSIAM SYMPOS. DISCRETE ALGORITHMS
, 2000
"... An instance of the curve reconstruction problem is a nite sample V of an unknown curve and the task is to connect the points in V in the order in which they lie on . Giesen [Gie99] showed recently that the Traveling Salesman tour of V solves the reconstruction problem under fairly week assumptio ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
An instance of the curve reconstruction problem is a nite sample V of an unknown curve and the task is to connect the points in V in the order in which they lie on . Giesen [Gie99] showed recently that the Traveling Salesman tour of V solves the reconstruction problem under fairly week
Curve reconstruction from noisy samples
 PROC. 19TH ANNU. SYMPOS. COMPUT. GEOM
"... We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing points on the curves according to a locally uniform distribution followed by a uniform perturbation in the normal directions ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing points on the curves according to a locally uniform distribution followed by a uniform perturbation in the normal
Abstract A Simple Provable Algorithm for Curve Reconstruction
"... We present an algorithm that provably recon� structs a curve in the framework introduced by Amenta � Bern and Eppstein. The highlights of the algorithm are � �i � it is simple � �ii � it requires a sam� pling density better than previously known � �iii � it can be adapted for curve reconstruction in ..."
Abstract
 Add to MetaCart
We present an algorithm that provably recon� structs a curve in the framework introduced by Amenta � Bern and Eppstein. The highlights of the algorithm are � �i � it is simple � �ii � it requires a sam� pling density better than previously known � �iii � it can be adapted for curve reconstruction
Traveling salesmanbased curve reconstruction in polynomial time
 IN &QUOT;SIAM JOURNAL ON COMPUTING
, 2001
"... An instance of the curve reconstruction problem is a finite sample set V of an unknown collection of curves γ. The task is to connect the points in V in the order in which they lie on γ. Giesen [Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SCG ’99), 1999, pp. 207–216] sho ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
An instance of the curve reconstruction problem is a finite sample set V of an unknown collection of curves γ. The task is to connect the points in V in the order in which they lie on γ. Giesen [Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SCG ’99), 1999, pp. 207
Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem
 In Proc. 8th Discrete Geometry and Computational Imagery (DGCI) Conference
, 1999
"... . Given a finite set of points sampled from a curve, we want to reconstruct the ordering of the points along the curve. Every ordering of the sample points can be defined by a polygon through these points. We show that for simple, regular curves Traveling Salesman Paths give the correct polygonal ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
. Given a finite set of points sampled from a curve, we want to reconstruct the ordering of the points along the curve. Every ordering of the sample points can be defined by a polygon through these points. We show that for simple, regular curves Traveling Salesman Paths give the correct
Results 1  10
of
1,600