Selection and sorting in totally monotone arrays

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 494-502

  Kravets, Dina ^a   Park, James K ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

CONVEX POLYGON; FOLLOWING PROBLEM; TWO-DIMENSIONAL ARRAYS;

PROBLEM SOLVING;

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

References (21)

1. [AGSS87] A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear time algorithm for computing the Voronoi diagram of a convex polygon. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 39-47, 1987.
2. [AK89] A. Aggarwal and D. Kravets. A linear time algorithm for finding all farthest neighbors in a convex polygon. Information Processing Letters, 31:17-20, 1989.
3. [AKM+87] A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix-searching algorithm. Algorithmica, 2:195-208, 1987.
4. [AP89a] A. Aggarwal and J. Park. Parallel searching in multidimensional monotone arrays. Journal of Algorithms, 1989.
5. Submitted. Portions of this paper appear in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988.
6. [AP89b] A. Aggarwal and J. Park. Sequential searching in multidimensional monotone arrays. Journal of Algorithms, 1989.
7. Submitted. Portions of this paper appear in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988.
8. [BFP+72] M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448-461, 1972.
9. [Cha85] B. M. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31:509-517, 1985.
10. [Cha87] B. M. Chazelle. Some techniques for geometric searching with implicit set representations. Acta Informatica, 24:565-582, 1987.
11. [Ede86] H. Edelsbrunner. Edge skeletons in arrangements with applications. Algorithmica, 1:93-109, 1986.
12. [FJ82] G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in X + Y and matrices with sorted columns. Journal of Computer and System Sciences, 24:197-208, 1982.
13. [Fre76] M. L. Fredman. How good is the information theory bound in sorting? Theoretical Computer Science, 1:355-361, 1976.
14. [Gui88] L. J. Guibas, 1988. Personal communication (via Alok Aggarwal).
15. [Knu73] D. E. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
16. [Kra88] D. Kravets. Finding farthest neighbors in a convex polygon and related problems. Master's thesis, Massachusetts Institute of Technology, December 1988. Also published as Technical Report MIT/LCS/TR-437, January, 1989.
17. [Lee82] D. T. Lee. On k-nearest neighbor Voronoi diagrams in the plane. IEEE Transactions on Computers, C-31:478-487, 1982.
18. [LP78] D. T. Lee and F. P. Preparata. The all nearest-neighbor problem for convex polygons. Information Processing Letters, 7(4):189-192, 1978.
19. [MSS89] Y. Mansour, B. Schieber, and S. Sen, September 1989. Personal communication (via Yishay Mansour).
20. [W1188] R. Wilber. The concave least-weight subsequence problem revisited. Journal of Algorithms, 9:418-425, 1988.
21. [YL79] C. C. Yang and D. T. Lee. A note on the all nearest-neighbor problem for convex polygons. Information Processing Letters, 8(4):193-194, 1979.