{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:10:08Z","timestamp":1765231808960,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":12,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_451","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:58:40Z","timestamp":1253091520000},"page":"3438-3440","source":"Crossref","is-referenced-by-count":2,"title":["Voronoi Diagrams"],"prefix":"10.1007","author":[{"given":"Cyrus","family":"Shahabi","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Sharifzadeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"451_CR1_451","doi-asserted-by":"crossref","unstructured":"Banaei-Kashani F. and Shahabi C. SWAM: a family of access methods for similarity-search in peer-to-peer data networks. In Proc. Int. Conf. on Information and Knowledge Management, 2004, pp. 304\u2013313.","DOI":"10.1145\/1031171.1031236"},{"key":"451_CR2_451","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. de Berg","year":"2000","unstructured":"de Berg M., van Kreveld M., Overmars M., and Schwarzkopf O. Computational Geometry: Algorithms and Applications, 2nd ed. Springer, Berlin Heidelberg New York, 2000.","edition":"2"},{"key":"451_CR3_451","doi-asserted-by":"crossref","unstructured":"Hagedoorn M. Nearest neighbors can be found efficiently if the dimension is small relative to the input size. In Proc. 9th Int. Conf. on Database Theory, 2003, pp. 440\u2013454.","DOI":"10.1007\/3-540-36285-1_29"},{"key":"451_CR4_451","doi-asserted-by":"crossref","unstructured":"Kolahdouzan M. and Shahabi C. Voronoi-based K nearest neighbor search for spatial network databases. In Proc. 30th Int. Conf. on Very Large Data Bases, 2004, pp. 840\u2013851.","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"451_CR5_451","doi-asserted-by":"crossref","unstructured":"Korn F. and Muthukrishnan S. Influence sets based on reverse nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2000, pp. 201\u2013212.","DOI":"10.1145\/335191.335415"},{"key":"451_CR6_451","volume-title":"Multi-Dimensional Nearest Neighbor Searching with Low-dimensional Data. PhD thesis, Computer Science Department","author":"S. Maneewongvatana","year":"2001","unstructured":"Maneewongvatana S. Multi-Dimensional Nearest Neighbor Searching with Low-dimensional Data. PhD thesis, Computer Science Department, University of Maryland, College Park, MD, USA, 2001."},{"key":"451_CR7_451","doi-asserted-by":"crossref","DOI":"10.1002\/9780470317013","volume-title":"Spatial Tessellations, Concepts and Applications of Voronoi Diagrams","author":"A. Okabe","year":"2000","unstructured":"Okabe A., Boots B., Sugihara K., and Chiu S.N. Spatial Tessellations, Concepts and Applications of Voronoi Diagrams, 2nd edn. Wiley, Chichester, UK, 2000.","edition":"2"},{"key":"451_CR8_451","doi-asserted-by":"crossref","unstructured":"Sharifzadeh M. and Shahabi C. Processing optimal sequenced route queries using voronoi diagrams. Geoinformatica 12(4), Springer Netherlands, December 2008, pp. 411\u2013433.","DOI":"10.1007\/s10707-007-0034-z"},{"key":"451_CR9_451","volume-title":"Spatial Query Processing Using Voronoi Diagrams. PhD thesis, Computer Science Department","author":"M. Sharifzadeh","year":"2007","unstructured":"Sharifzadeh M. Spatial Query Processing Using Voronoi Diagrams. PhD thesis, Computer Science Department, University of Southern California, Los Angeles, CA, 2007."},{"key":"451_CR10_451","unstructured":"Stanoi I., Riedewald M., Agrawal D., and El Abbadi A. Discovery of influence sets in frequently updated databases. In Proc. 27th Int. Conf. on Very Large Data Bases, 2001, pp. 99\u2013108."},{"issue":"12","key":"451_CR11_451","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/TKDE.2004.97","volume":"16","author":"J. Xu","year":"2004","unstructured":"Xu J., Zheng B., Lee W.-C., and Lee D.L. The D-tree: an index structure for planar point queries in location-based wireless services. IEEE Trans. Knowl. Data Eng., 16(12):1526\u20131542, 2004.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"451_CR12_451","doi-asserted-by":"crossref","unstructured":"Zhang J., Zhu M., Papadias D., Tao Y., and Lee D.L. Location-based spatial queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2003, pp. 443\u2013453.","DOI":"10.1145\/872757.872812"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T04:53:24Z","timestamp":1590987204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_451","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}