Notes on searching in multidimensional monotone arrays

A two-dimensional array A=(a/sub i,j/) is called monotone if the maximum entry in its ith row lies below or to the right of the maximum entry in its (i- 1)-st row. An array A is called totally monotone if every 2*2 subarray (i.e., every 2*2 minor) is monotone. The notion of two-dimensional totally monotone arrays is generalized to multidimensional arrays, and a wide variety of problems are exhibited involving computational geometry, dynamic programming, VLSI river routing, and finding certain kinds of shortest paths that can be solved efficiently by finding maxima in totally monotone arrays.<<ETX>>

[1]  David P. Dobkin,et al.  Finding Extremal Polygons , 1985, SIAM J. Comput..

[2]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[3]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[4]  Alok Aggarwal,et al.  Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.

[5]  Alan Siegel,et al.  Some Geometry for General River Routing , 1988, SIAM J. Comput..

[6]  Robert E. Wilber.  The Concave Least-Weight Subsequence Problem Revisited , 1988, J. Algorithms.

[7]  F. Frances Yao,et al.  Efficient dynamic programming using quadrangle inequalities , 1980, STOC '80.

[8]  Mikhail J. Atallah,et al.  Constructing trees in parallel , 1989, SPAA '89.

[9]  Lawrence L. Larmore,et al.  The least weight subsequence problem , 1987, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[10]  Alan Siegel,et al.  The Separation for General Single-Layer Wiring Barriers , 1981 .

[11]  Andranik Mirzaian,et al.  River Routing in VLSI , 1987, J. Comput. Syst. Sci..

[12]  Alok Aggarwal,et al.  An Optimal Algorithm for Finding Minimal Enclosing Triangles , 1986, J. Algorithms.

[13]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[15]  Godfried T. Toussaint.  The symmetric all-furthest- neighbor problem , 1983 .

[16]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, CACM.

[17]  Temple F. Smith,et al.  Rapid dynamic programming algorithms for RNA secondary structure , 1986 .

[18]  Faith Ellen,et al.  Relations Between Concurrent-Write Models of Parallel Computation , 1988, SIAM J. Comput..

[19]  Joseph JaJa,et al.  Parallel Algorithms for River Routing. , 1987 .

[20]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.