@inproceedings{b72511a2c7e04295955e57ac68678458,

title = "Dynamically computing the maxima of decomposable functions, with applications",

abstract = "The authors present a general technique for updating the maximum (minimum) value of a decomposable function as elements are inserted into and deleted from the set S. Applications of this technique include efficient algorithms for dynamically computing the diameter or closest pair of a set of points, minimum separation among a set of rectangles, smallest distance between a set of points and a set of hyperplanes, and largest or smallest area (perimeter) rectangles determined by a set of points. The main appeal of the approach lies in its generality. Several research directions suggested by the work are noted.",

author = "David Dobkin and Subhash Suri",

year = "1989",

month = nov,

day = "1",

language = "English (US)",

isbn = "0818619821",

series = "Annual Symposium on Foundations of Computer Science (Proceedings)",

publisher = "Publ by IEEE",

pages = "488--493",

booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

note = "30th Annual Symposium on Foundations of Computer Science ; Conference date: 30-10-1989 Through 01-11-1989",

}