PAMI
2002
13 years 11 months ago
2002
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
ALGORITHMICA
2005
13 years 11 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
COMGEO
2008
ACM
13 years 11 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
This paper proposes a distributed coordination algorithm for robotic sensor networks to detect boundaries that separate areas of abrupt change of spatial phenomena. We consider an ...
ICPR
2000
IEEE
14 years 3 months ago
2000
IEEE
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
COMPGEOM
2003
ACM
14 years 4 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...