Entropy-preserving cuttings and space-efficient planar point location

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 256-261

  Arya, Sunil ^a   Malamatos, Theocharis ^a   Mount, David M ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b University of Maryland ^*  (United States)

Author keywords

Algorithms; Design; Performance; Theory; Verification

Indexed keywords

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

References (15)

1. U. Adamy and R. Seidel. Planar point location close to the information-theoretic lower bound. In Proc. 9th AGM-SIAM Sympos. Discrete Algorithms, 1998.
2. Sunil Arya , Siu-Wing Cheng , David M. Mount , Ramesh Hariharan, Efficient ExpectedCase Algorithms for Planar Point Location, Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, p.353-366, July 05-07, 2000
3. S. Arya , T. Malamatos , D. M. Mount, Nearly optimal expected-case planar point location, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p.208, November 12-14, 2000
4. Sunil Arya , Theocharis Malamatos , David M. Mount, A simple entropy-based algorithm for planar point location, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.262-268, January 07-09, 2001, Washington, D.C., United States
5. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10(3):229-249, 1990.
6. Richard Cole, Searching and sorting similar lists, Journal of Algorithms, v.7 n.2, p.202-220, June 1986 [doi〉10.1016/0196-6774(86)90004-0]
7. Herbert Edelsbrunner , Lionidas J Guibas , Jorge Stolfi, Optimal point location in a monotone subdivision, SIAM Journal on Computing, v.15 n.2, p.317-340, May 1986 [doi〉10.1137/0215023]
8. Michael T. Goodrich , Mark Orletsky , Kumar Ramaiyer, Methods for achieving fast query times in point location data structures, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.757-766, January 05-07, 1997, New Orleans, Louisiana, United States
9. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12(1):28-35, 1983.
10. Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
11. K. Mehlhorn. Best possible bounds on the weighted path length of optimum binary search trees. SIAM J. Comput., 6:235-239, 1977.
12. K. Mulmuley, A fast planar partition algorithm, I, Journal of Symbolic Computation, v.10 n.3-4, p.253-280, Sept./Oct. 1990 [doi〉10.1016/S0747- 7171(08)80064-8]
13. Neil Sarnak , Robert E. Tarjan, Planar point location using persistent search trees, Communications of the ACM, v.29 n.7, p.669-679, July 1986 [doi〉10.1145/6138.6151]
14. Raimund Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications, v.1 n.1, p.51-64, July 1991 [doi〉10.1016/S0925-7721(99) 00042-5]
15. C. E. Shannon. A mathematical theory of communication. Bell Sys. Tech. Journal, 27:379-423, 623-656, 1948.