Pattern matching for sets of segments

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 295-304

  Efrat, Alon ^a   Indyk, Piotr ^a   Venkatasubramanian, Suresh ^b  

^a Stanford University   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithms; Measurement; Performance; Theory; Verification

Indexed keywords

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

References (22)

1. Karl Abrahamson, Generalized string matching, SIAM Journal on Computing, v.16 n.6, p.1039-1051, December 1, 1987 [doi>10.1137/0216067]
2. Pankaj K. Agarwal , Micha Sharir , Sivan Toledo, Applications of parametric searching in geometric optimization, Journal of Algorithms, v.17 n.3, p.292-318, Nov. 1994
3. H. Alt and M. Godau. Computing the Frrchet distance between two polygonal curves. International J. of Computational Geometry and Applications, 5:75-91, 1995.
4. Amihood Amir , Martin Farach, Efficient 2-dimensional approximate matching of halfrectangular figures, Information and Computation, v.118 n.1, p.1-11, April 1995 [doi>10.1006/inco.1995.1047 ]
5. Gill Barequet , Sariel Har-Peled, Polygon-containment and translational min-Hausdorffdistance between segment sets are 3SUM-hard, Proceedings of the tenth annual ACMSIAM symposium on Discrete algorithms, p.862-863, January 17-19, 1999, Baltimore, Maryland, United States
6. Przemyslaw Bogacki , Stanley E. Weinstein, Generalized Fréchet distance between curves, Proceedings of the international conference on Mathematical methods for curves and surfaces II Lillehammer, 1997, p.25-32, June 1998, Lillehammer, Norway 7 David E. Cardoze , Leonard J. Schulman, Pattern Matching for Spatial Point Sets, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.156, November 08-11, 1998
7. Bernard Chazelle, Cutting hyperplanes for divide-and-conquer, Discrete & Computational Geometry, v.9 n.2, p.145-158, 1993
8. L. Paul Chew , Michael T. Goodrich , Daniel P. Huttenlocher , Klara Kedem , Jon M. Kleinberg , Dina Kravets, Geometric pattern matching under Euclidean motion, Computational Geometry: Theory and Applications, v.7 n.1-2, p.113-124, Jan. 1997 [doi>10.1016/0925-7721(95)00047-X ]
9. L. Paul Chew , Dorit Dor , Alon Efrat , Klara Kedem, Geometric Pattern Matching in dDimensional Space, Proceedings of the Third Annual European Symposium on Algorithms, p.264-279, September 25-27, 1995
10. L. Paul Chew , Klara Kedem, Improvements on Geometric Pattern Matching Problems, Proceedings of the Third Scandinavian Workshop on Algorithm Theory, p.318-325, July 08-10, 1992
11. Don Coppersmith , Shmuel Winograd, Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation, v.9 n.3, p.251-280, March 1990 [doi>10.1016/S0747-7171(08)80013-2]
12. M. de Berg and O. Schwarzkopf. Cuttings and applications, lnternat. J. Comput. Geom. Appl., 5:343-355, 1995.
13. Michael Godau. On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Department Mathematik u. Informatik, Freie Universitt Berfin, December 1998.
14. Paul J. Heffernan , Stefan Schirra, Approximate decision algorithms for point set congruence, Computational Geometry: Theory and Applications, v.4 n.3, p.137-156, July 1994 [doi>10.1016/0925-7721(94)90004-3]
15. Jacob Holm , Kristian de Lichtenberg , Mikkel Thorup, Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.79-89, May 24-26, 1998, Dallas, Texas, United States [doi>10.1145/276698.276715]
16. Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian, Geometric matching under noise: combinatorial bounds and algorithms, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.457-465, January 17-19, 1999, Baltimore, Maryland, United States
17. Klara Kedem , Ron Livne , János Pach , Micha Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete & Computational Geometry, v.1 n.1, p.59-71, 1986 [doi>10.1007/BF02187683]
18. Valerie King, Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.81, October 17-18, 1999
19. S. R. Kosaraju. Efficient string matching. Manuscript, 1987.
20. W.T. Rucklidge. Lower bounds for the complexity of the Hausdorff distance. In Proc. 5th Canadian Conference on Computational Geometry, pages 145- 150, 1993.
21. Suresh Venkatasubramanian , Rajeev Motwani, Geometric shape matching and drug design, 1999
22. A. Winzen and H. Niemann. Matching and fusing 3D-polygonal approximations for model generation. In Proc. IEEE International Conference on Image Processing, volume 1, pages 228-232, Austin, Texas, 1994.