Sciweavers

PAMI
2002
103views more  PAMI 2002»
13 years 10 months ago
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
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 ...
Thomas Bülow, Reinhard Klette
ALGORITHMICA
2005
95views more  ALGORITHMICA 2005»
13 years 10 months ago
Near-Linear Time Approximation Algorithms for Curve Simplification
Abstract. We consider the problem of approximating a polygonal curve
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Must...
COMGEO
2008
ACM
13 years 11 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
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...
Robert L. Scot Drysdale, Günter Rote, Astrid ...
HYBRID
2009
Springer
14 years 2 months ago
Distributed Wombling by Robotic Sensor Networks
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 ...
Jorge Cortés
ICPR
2000
IEEE
14 years 3 months ago
Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves
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 ...
Thomas Bülow, Reinhard Klette
COMPGEOM
2003
ACM
14 years 4 months ago
Finding a curve in a map
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...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...