{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:15Z","timestamp":1725535995893},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","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-3-642-03367-4_43","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"495-506","source":"Crossref","is-referenced-by-count":2,"title":["Computing the Implicit Voronoi Diagram in Triple Precision"],"prefix":"10.1007","author":[{"given":"David L.","family":"Millman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"43_CR1","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539796305365","volume":"28","author":"G. Liotta","year":"1999","unstructured":"Liotta, G., Preparata, F.P., Tamassia, R.: Robust proximity queries: An illustration of degree-driven algorithm design. SIAM J. Comput.\u00a028(3), 864\u2013889 (1999)","journal-title":"SIAM J. Comput."},{"key":"43_CR2","doi-asserted-by":"publisher","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, New York (2008)","edition":"3"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica\u00a02, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L.J. Guibas","year":"1992","unstructured":"Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica\u00a07, 381\u2013413 (1992)","journal-title":"Algorithmica"},{"key":"43_CR5","first-page":"151","volume-title":"SFCS 1975: Proceedings of the 16th Annual Symposium on Foundations of Computer Science","author":"M.I. Shamos","year":"1975","unstructured":"Shamos, M.I., Hoey, D.: Closest-point problems. In: SFCS 1975: Proceedings of the 16th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 151\u2013162. IEEE Computer Society, Los Alamitos (1975)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Karamcheti, V., Li, C., Pechtchanski, I., Yap, C.: A core library for robust numeric and geometric computation. In: SCG 1999: Proceedings of the fifteenth annual symposium on Computational geometry, pp. 351\u2013359 (1999)","DOI":"10.1145\/304893.304989"},{"issue":"1-2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0925-7721(95)00040-2","volume":"7","author":"C.K. Yap","year":"1997","unstructured":"Yap, C.K.: Towards exact geometric computation. Comput. Geom. Theory Appl.\u00a07(1-2), 3\u201323 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"43_CR8","unstructured":"Cgal, Computational Geometry Algorithms Library, \n                  \n                    http:\/\/www.cgal.org"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Burnikel, C., K\u00f6nemann, J., Mehlhorn, K., N\u00e4her, S., Schirra, S., Uhrig, C.: Exact geometric computation in LEDA. In: SCG 1995: Proceedings of the eleventh annual symposium on Computational geometry, pp. 418\u2013419 (1995)","DOI":"10.1145\/220279.220330"},{"issue":"4","key":"43_CR10","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/PL00009400","volume":"20","author":"O. Devillers","year":"1998","unstructured":"Devillers, O., Preparata, F.P.: A probabilistic analysis of the power of arithmetic filters. Discrete and Computational Geometry\u00a020(4), 523\u2013547 (1998)","journal-title":"Discrete and Computational Geometry"},{"issue":"2","key":"43_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0925-7721(99)00011-5","volume":"13","author":"O. Devillers","year":"1999","unstructured":"Devillers, O., Preparata, F.P.: Further results on arithmetic filters for geometric predicates. Comput. Geom. Theory Appl.\u00a013(2), 141\u2013148 (1999)","journal-title":"Comput. Geom. Theory Appl."},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Fortune, S., Van Wyk, C.J.: Efficient exact arithmetic for computational geometry. In: SCG 1995: Proceedings of the eleventh annual symposium on Computational geometry, pp. 163\u2013172 (1993)","DOI":"10.1145\/160985.161015"},{"issue":"3","key":"43_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"J.R. Shewchuk","year":"1997","unstructured":"Shewchuk, J.R.: Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. Discrete & Computational Geometry\u00a018(3), 305\u2013363 (1997)","journal-title":"Discrete & Computational Geometry"},{"issue":"9","key":"43_CR14","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. Proceedings of the IEEE\u00a080(9), 1471\u20131484 (1992)","journal-title":"Proceedings of the IEEE"},{"issue":"5","key":"43_CR15","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1137\/S0097539797329373","volume":"29","author":"J.D. Boissonnat","year":"2000","unstructured":"Boissonnat, J.D., Preparata, F.P.: Robust plane sweep for intersecting segments. SIAM J. Comput.\u00a029(5), 1401\u20131421 (2000)","journal-title":"SIAM J. Comput."},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Boissonnat, J.D., Snoeyink, J.: Efficient algorithms for line and curve segment intersection using restricted predicates. In: SCG 1999: Proceedings of the fifteenth annual symposium on Computational geometry, pp. 370\u2013379 (1999)","DOI":"10.1145\/304893.304991"},{"issue":"4","key":"43_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0925-7721(00)00012-2","volume":"16","author":"T.M. Chan","year":"2000","unstructured":"Chan, T.M.: Reporting curve segment intersections using restricted predicates. Comput. Geom. Theory Appl.\u00a016(4), 245\u2013256 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"43_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams a survey of a fundamental geometric data structure. ACM Comput. Surv.\u00a023(3), 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Hoff, K.E., Keyser, J., Lin, M., Manocha, D., Culver, T.: Fast computation of generalized voronoi diagrams using graphics hardware. In: SIGGRAPH 1999: Proceedings of the 26th annual conference on Computer graphics and interactive techniques, pp. 277\u2013286 (1999)","DOI":"10.1145\/311535.311567"},{"key":"43_CR20","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/34.391389","volume":"17","author":"H. Breu","year":"1995","unstructured":"Breu, H., Gil, J., Kirkpatrick, D., Werman, M.: Linear time Euclidean distance transform algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a017, 529\u2013533 (1995)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T01:45:36Z","timestamp":1552095936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}