This paper's main result is an -time algorithm for computing the kth smallest entry in each row of an m×n totally monotone array. (A two-dimensional array A={a[i, j]} is totally monotone if for all i1<i2 and j1<j2, a[i1, j1]<a[i1, j2] implies a[i2, j1]<a[i2, j2].) For large values of k (in particular, for k=⌈n/2⌉), this algorithm is significantly faster than the O(k(m + n))-time algorithm for the same problem due to Kravets and Park. An immediate consequence of this result is an O(n3/2lg1/2 n)-time algorithm for computing the kth nearest neighbor of each vertex of a convex n-gon. In addition to the main result, we also give an O(n lg m)-time algorithm for computing an approximate median in each row of an m×n totally monotone array; this approximate median is an entry whose rank in its row lies between ⌊n/4⌋ and ⌈3n/4⌉ − 1.
[1]
Alok Aggarwal,et al.
Parallel searching in generalized Monge arrays with applications
,
1990,
SPAA '90.
[2]
Dina Kravets,et al.
Selection and sorting in totally monotone arrays
,
1990,
SODA '90.
[3]
Baruch Schieber,et al.
Improved Selection on Totally Monotone Arrays
,
1991,
FSTTCS.
[4]
Alok Aggarwal,et al.
Improved Algorithms for Economic Lot Size Problems
,
1993,
Oper. Res..
[5]
Alok Aggarwal,et al.
Sequential Searching in Multidimensional Monotone Arrays
,
1989
.
[6]
David Eppstein,et al.
Sequence Comparison with Mixed Convex and Concave Costs
,
1990,
J. Algorithms.
[7]
Robert E. Wilber.
The Concave Least-Weight Subsequence Problem Revisited
,
1988,
J. Algorithms.