Sciweavers

SODA
2001
ACM
86views Algorithms» more  SODA 2001»
14 years 5 days ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
COMPGEOM
2008
ACM
14 years 18 days ago
Walking your dog in the woods in polynomial time
The Fr
Erin W. Chambers, Éric Colin de Verdi&egrav...
COMPGEOM
2005
ACM
14 years 23 days ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
COMPGEOM
2007
ACM
14 years 2 months ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
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 ...
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
14 years 5 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk