Matching planar maps

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 589-598

  Alt, Helmut ^a   Efrat, Alon ^b   Rote, Günter ^a   Wenk, Carola ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; DECISION THEORY; GRAPH THEORY; OPTIMIZATION; THEOREM PROVING;

GEOMETRIC GRAPH; PLANAR MAPS; POLYGONAL CURVE;

ALGORITHMS;

EID: 0038416016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl., 5:75-91, 1995.
2. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM, 34(1):200-208, 1987.
3. Dan Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
4. D.S. Hirschberg. Algorithms for the longest common subsequence problem. J. ACM, 24:664-675, 1977.