35 search results - page 4 / 7 » compgeom 2003 |
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
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 po...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...