Geometric pattern matching in d-dimensional space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 979, Issue , 1995, Pages 264-279

  Chew, L Paul ^a   Dor, Dorit ^b   Efrat, Alon ^b   Kedem, Klara ^c  

^a Cornell University ^*  (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PATTERN MATCHING;

CARDINALITIES; D-DIMENSIONAL SPACES; D-SPACE; GEOMETRIC PATTERN MATCHING; HAUSDORFF DISTANCE; TIME BOUND; TWO-POINT;

GEOMETRY;

EID: 35248890059     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. P. K. Agarwal, B. Aronov and M. Sharir, Computing Envelopes in Four Dimensions with Appfications, Proc. 10th Annual AGM Symposium on Computational Geometry 1994, 348-358.
2. P. K. Agarwal, M. Sharir and S. Toledo, Appfications of Parametric Searching in Geometric Optimization, Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, 1992, 72-82.
3. N. M. Amato, M. T. Goodrich and E. R. Ramos, Parallel Algorithms for Higher-Dimensional Convex Hulls, Proceedings 6 Annual ACM Symposium on Theory of Computing 1994, 683-694.
4. J. Boissonnat, M. Sharir, B. Tagansky and M. Yvinec, Voronoi Diagrams in Higher Dimensions under Certalrt Polyhedral Distance Functions, Proc. 11th Annual A CM Symposium on Computational Geometry 1995, 79-88.
5. H. BrSnnimann, B. Chazelle and J. Matoušek, Product Range Spaces, Sensitive Sampling, and Derandomization, Proc. 34th Annual 1EEE Symposium on the Foundations of Computer Science 1993, 400-409.
6. B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, A Singly Exponential Stratification Scheme for Real Semi-algebraic Varieties and Its Applications, Theoretical Computer Science 84 (1991), 77-105.
7. L.P. Chew and K. Kedem, Improvements on Geometric Pattern Matching Problems, Algorithm Theory- SWAT '92, edited by O. Nurmi and E. Ukkonen, Lecture Notes in Computer Science #621, Springer-Verhg, July 1992, 318-325.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, Germany, 1987.
9. A. Efrat and M. Sharir, A Near-linear Algorithm for the Planar Segment Center Problem, Discrete and Computational Geometry, to appear.
10. G.N. Frederickson and D.B. Johnson, Finding kth Paths and p-Centers by Generating and Searching Good Data Structures, Journal of Algorithms, 4 (1983), 61-80.
11. D.P. Huttenlocher and K. Kedem, Efficiently Computing the Hausdorff Distance for Point Sets under Translation, Proceedings of the Sixth A CM Symposium on Computational Geometry 1990, 340-349.
12. D.P. Huttenlocher, K. Kedein and M. Sharir, The Upper Envelope of Voronoi Surfaces and its Appfications, Discrete and Computational Geometry, 9 (1993), 267-291.
13. J. Matoušek, Reporting Points in Halfspaces, Comput. Geom. Theory Appls. 2 (1992), 169-186.
14. J. Matoušek and O. Schwarzkopf, Linear Optimization Queries, Proc. 8th Annual A CM Symposium on Computational Geometry 1992, 16-25.
15. N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, J. ACM 30 (1983), 852-865.
16. M. Overmars and C.K. Yap, New Upper Bounds in Klee's Measure Problem, SlAM Journal of Computing, 20:6 (1991), 1034-1045.
17. F.P. Preparata and M.I. Shamos, Computational Geometry, Springer-Verlag, New York, Berlin, Heidelberg, Tokyo, 1985.
18. W. Rucklidge, Lower Bounds for the Complexity of the Hausdorff Distance, Proc. 5th Canadian Conference on Computational Geometry 1993, 145-150.
19. W. Rucklidge, Private Communication.
20. R. Seidel, Small-dimensional Linear Programming and Convex Hulls Made Easy, Discrete and Computational Geometry, 6 (1991), 423-434.