Geometric pattern matching in d-dimensional space

Discrete and Computational Geometry

Volumn 21, Issue 2, 1999, Pages 257-274

  Chew, L P ^a   Dor, D ^b   Efrat, A ^b   Kedem, K ^c  

^a School of Operations Research and Information Engineering   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033478042     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009420     Document Type: Article

References (15)

1. P.K. Agarwal, M. Sharir, and S. Toledo, Applications of Parametric Searching in Geometric Optimization, Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 72-82.
2. N.M. Amato, M.T. Goodrich, and E.R. Ramos, Parallel Algorithms for Higher-Dimensional Convex Hulls, Proc. 6th Annual ACM Symposium on Theory of Computing, 1994, pp. 683-694.
3. J. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec, Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions, Proc. 11th Annual ACM Symposium on Computational Geometry, 1995, pp. 79-88.
4. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, Diameter, Width, Closest Line Pair and Parametric Searching, Discrete Comput. Geom. 10 (1993), pp. 183-196.
5. L.P. Chew, D. Dor, A. Efrat, and K. Kedem, Geometric Pattern Matching in d-Dimensional Space, Proc. Third Annual European Symposium on Algorithms, 1995, edited by P. Spirakis, pp. 264-279.
6. 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-Verlag, Berlin, July 1992, pp. 318-325.
7. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
8. G. Frederickson and D. Johnson, Generalized Selection and Ranking: Sorted Matrices, SIAM J. Comput. 13 (1984), 14-30.
9. D.P. Huttenlocher and K. Kedem, Efficiently Computing the Hausdorff Distance for Point Sets under Translation, Proc. Sixth ACM Symposium on Computational Geometry, 1990, pp. 340-349.
10. D.P. Huttenlocher, K. Kedem, and M. Sharir, The Upper Envelope of Voronoi Surfaces and Its Applications, Discrete Comput. Geom. 9 (1993), 267-291.
11. J. Matoušek, Reporting Points in Halfspaces, Comput. Geom. Theory Appl. 2 (1992), 169-186.
12. N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
13. M. Overmars and C.K. Yap, New Upper Bounds in Klee's Measure Problem, SIAM J. Comput. 20 (1991), 1034-1045.
14. W.J. Rucklidge, Lower Bounds for the Complexity of the Hausdorff Distance, Discrete Comput. Geom. 16(2), 1996, 135-153.
15. R. Seidel, Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face, Proc. 18th Annual ACM Symposium in Theory of Computing, 1986, pp. 404-413.