Dynamic half-space reporting, geometric optimization, and minimum spanning trees Export

@article{citeulike:3505586, abstract = {The authors describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, they obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter, and Euclidean minimum spanning tree.}, address = {Los Alamitos, CA, USA}, author = {Agarwal, P. K. and Eppstein, D. and Matousek, J.}, citeulike-article-id = {3505586}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267816}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/SFCS.1992.267816}, doi = {10.1109/SFCS.1992.267816}, journal = {Symposium on Foundations of Computer Science}, keywords = {algorithms, data\_structure, geometries}, pages = {80--89}, posted-at = {2008-11-12 11:36:26}, priority = {2}, publisher = {IEEE Computer Society}, title = {Dynamic half-space reporting, geometric optimization, and minimum spanning trees}, url = {http://dx.doi.org/10.1109/SFCS.1992.267816}, volume = {0}, year = {1992} }

TY - JOUR ID - citeulike:3505586 L3 - citeulike-article-id:3505586 N2 - The authors describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, they obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter, and Euclidean minimum spanning tree. JF - Symposium on Foundations of Computer Science AD - Los Alamitos, CA, USA EP - 89 TI - Dynamic half-space reporting, geometric optimization, and minimum spanning trees PB - IEEE Computer Society VL - 0 SP - 80 KW - algorithms KW - data_structure KW - geometries AU - Agarwal, PK AU - Eppstein, D AU - Matousek, J PY - 1992/// UR - http://dx.doi.org/10.1109/SFCS.1992.267816 ER -