{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:34:26Z","timestamp":1768520066993,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642452772","type":"print"},{"value":"9783642452789","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45278-9_30","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T15:35:18Z","timestamp":1385393718000},"page":"349-361","source":"Crossref","is-referenced-by-count":9,"title":["Fitting Voronoi Diagrams to Planar Tesselations"],"prefix":"10.1007","author":[{"given":"Greg","family":"Aloupis","sequence":"first","affiliation":[]},{"given":"Hebert","family":"P\u00e9rez-Ros\u00e9s","sequence":"additional","affiliation":[]},{"given":"Guillermo","family":"Pineda-Villavicencio","sequence":"additional","affiliation":[]},{"given":"Perouz","family":"Taslakian","sequence":"additional","affiliation":[]},{"given":"Dannier","family":"Trinchet-Almaguer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00181470","volume":"19","author":"P. Ash","year":"1985","unstructured":"Ash, P., Bolker, E.D.: Recognizing Dirichlet Tesselations. Geometriae Dedicata\u00a019, 175\u2013206 (1985)","journal-title":"Geometriae Dedicata"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0747-7171(87)80003-2","volume":"3","author":"F. Aurenhammer","year":"1987","unstructured":"Aurenhammer, F.: Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra. J. Symbolic Computation\u00a03, 249\u2013255 (1987)","journal-title":"J. Symbolic Computation"},{"key":"30_CR3","first-page":"132","volume-title":"Procs. 9th Int. IEEE Symp. on Voronoi Diagrams in Science and Engineering","author":"S. Banerjee","year":"2012","unstructured":"Banerjee, S., Bhattacharya, B.B., Das, S., Karmakar, A., Maheshwari, A., Roy, S.: On the Construction of a Generalized Voronoi Inverse of a Rectangular Tesselation. In: Procs. 9th Int. IEEE Symp. on Voronoi Diagrams in Science and Engineering, pp. 132\u2013137. IEEE, New Brunswick (2012)"},{"key":"30_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry. Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry. Algorithms and Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1287\/ijoc.4.4.369","volume":"4","author":"D. Hartvigsen","year":"1992","unstructured":"Hartvigsen, D.: Recognizing Voronoi Diagrams with Linear Programming. ORSA J. Comput.\u00a04, 369\u2013374 (1992)","journal-title":"ORSA J. Comput."},{"key":"30_CR6","unstructured":"Mart\u00ednez, A., Mart\u00ednez, J., P\u00e9rez-Ros\u00e9s, H., Quir\u00f3s, R.: Image Processing using Voronoi diagrams. In: Procs. 2007 Int. Conf. on Image Proc., Comp. Vision, and Pat. Rec., pp. 485\u2013491. CSREA Press (2007)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Ratti, B., Sommer, C.: Approximating Shortest Paths in Spatial Social Networks. In: Procs. 2012 ASE\/IEEE Int. Conf. on Social Computing and 2012 ASE\/IEEE Int. Conf. on Privacy, Security, Risk and Trust, pp. 585\u2013586. IEEE Comp. Soc. (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.132"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/comjnl\/46.1.76","volume":"46","author":"F.P. Schoenberg","year":"2003","unstructured":"Schoenberg, F.P., Ferguson, T., Li, C.: Inverting Dirichlet Tesselations. The Computer J.\u00a046, 76\u201383 (2003)","journal-title":"The Computer J."},{"key":"30_CR9","unstructured":"Sommer, C.: Approximate Shortest Path and Distance Queries in Networks. PhD Thesis, Department of Computer Science, The University of Tokyo, Japan (2010)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/5.163412","volume":"80","author":"K. Sugihara","year":"1992","unstructured":"Sugihara, K., Iri, M.: Construction of the Voronoi Diagram for \u2018One Million\u2019 Generators in Single-Precision Arithmetic. Procs. IEEE\u00a080, 1471\u20131484 (1992)","journal-title":"Procs. IEEE"},{"key":"30_CR11","unstructured":"Trinchet-Almaguer, D.: Algorithm for Solving the Generalized Inverse Voronoi Problem. Honour\u2019s Thesis, Department of Computer Science, University of Oriente, Cuba (2005) (in Spanish)"},{"issue":"4","key":"30_CR12","first-page":"58","volume":"1","author":"D. Trinchet-Almaguer","year":"2007","unstructured":"Trinchet-Almaguer, D., P\u00e9rez-Ros\u00e9s, H.: Algorithm for Solving the Generalized Inverse Voronoi Problem (in Spanish). Revista Cubana de Ciencias Informaticas\u00a01(4), 58\u201371 (2007)","journal-title":"Revista Cubana de Ciencias Informaticas"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1016\/S0362-546X(01)00315-7","volume":"47","author":"L. Yeganova","year":"2001","unstructured":"Yeganova, L., Falk, J.E., Dandurova, Y.V.: Robust Separation of Multiple Sets. Nonlinear Analysis\u00a047, 1845\u20131856 (2001)","journal-title":"Nonlinear Analysis"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Yeganova, L.E.: Robust linear separation of multiple finite sets. Ph.D. Thesis, George Washington University (2001)","DOI":"10.1016\/S0362-546X(01)00315-7"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1540276.1540279","volume":"10","author":"B. Zhou","year":"2008","unstructured":"Zhou, B., Pei, J., Luk, W.-S.: A brief survey on anonymization techniques for privacy preserving publishing of social network data. ACM SIGKDD Explorations Newsletter\u00a010, 12\u201322 (2008)","journal-title":"ACM SIGKDD Explorations Newsletter"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45278-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T16:17:31Z","timestamp":1597076251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45278-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452772","9783642452789"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45278-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}