101
Voted
COMPGEOM
2003
ACM
15 years 5 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...
110
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
121
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
82
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
81
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
95
Voted
COMPGEOM
2003
ACM
15 years 5 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...
76
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
91
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteed-quality meshes of domains in which lon...
79
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
94
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...