Closest-Point Problems in Computational Geometry

@misc{citeulike:118604, abstract = {This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in IR D . In particular, the closest pair problem, the exact and approximate post-office problem, and the problem of constructing spanners are discussed in detail. Contents 1 Introduction 1 2 The static closest pair problem 4 2.1 Preliminary remarks ....}, address = {Amsterdam}, author = {Smid, M. }, booktitle = {Handbook on Computational Geometry}, citeulike-article-id = {118604}, editor = {Sack, J. }, keywords = {surveys}, posted-at = {2006-05-16 04:42:48}, priority = {2}, publisher = {North Holland}, title = {Closest-Point Problems in Computational Geometry}, url = {http://citeseer.ist.psu.edu/167339.html}, year = {1997} }

TY - GEN ID - citeulike:118604 L3 - citeulike-article-id:118604 TI - Closest-Point Problems in Computational Geometry T2 - Handbook on Computational Geometry AD - Amsterdam PB - North Holland N2 - This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in IR D . In particular, the closest pair problem, the exact and approximate post-office problem, and the problem of constructing spanners are discussed in detail. Contents 1 Introduction 1 2 The static closest pair problem 4 2.1 Preliminary remarks .... KW - surveys AU - Smid, M A2 - Sack, J PY - 1997/// UR - http://citeseer.ist.psu.edu/167339.html ER -