{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:34Z","timestamp":1750307374673,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1810959.1811024","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"386-392","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing planar Voronoi diagrams in double precision"],"prefix":"10.1145","author":[{"given":"David L.","family":"Millman","sequence":"first","affiliation":[{"name":"University of North Carolina at Chapel Hill, Chapel Hill, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[{"name":"University of North Carolina at Chapel Hill, Chapel Hill, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797329373"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00057-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.391389"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00231-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/220279.220330"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1730804.1730818"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.002"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the Nineteenth Annual Fall Workshop on Computational Geometry","author":"Chan T. M.","year":"2009","unstructured":"T. M. Chan , D. L. Millman , and J. Snoeyink . Discrete Voronoi diagrams and post office query structures without the incircle predicate . In Proceedings of the Nineteenth Annual Fall Workshop on Computational Geometry , 2009 . http:\/\/cs.unc.edu\/ dave\/mySite\/media\/papers\/CMS09_FWCG.pdf. T. M. Chan, D. L. Millman, and J. Snoeyink. Discrete Voronoi diagrams and post office query structures without the incircle predicate. In Proceedings of the Nineteenth Annual Fall Workshop on Computational Geometry, 2009. http:\/\/cs.unc.edu\/ dave\/mySite\/media\/papers\/CMS09_FWCG.pdf."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"de Berg M.","year":"2008","unstructured":"M. de Berg , O. Cheong , M. van Kreveld , and M. Overmars . Computational Geometry: Algorithms and Applications . Springer-Verlag New York, Inc. , 3rd edition, 2008 . M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag New York, Inc., 3rd edition, 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840357"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/231731.231735"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/282918.282923"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(98)00041-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/363707.363723"},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes Comput","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams","author":"Klein R.","year":"1989","unstructured":"R. Klein . Concrete and Abstract Voronoi Diagrams , volume 400 of Lecture Notes Comput . Sci. Springer-Verlag , 1989 . R. Klein. Concrete and Abstract Voronoi Diagrams, volume 400 of Lecture Notes Comput. Sci. Springer-Verlag, 1989."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796305365"},{"key":"e_1_3_2_1_17_1","first-page":"244","volume-title":"Discrete and Computational Geometry, number 2098 in LNCS","author":"Mantler A.","year":"2001","unstructured":"A. Mantler and J. Snoeyink . Intersecting red and blue line segments in optimal time and precision . In Discrete and Computational Geometry, number 2098 in LNCS , pages 244 -- 251 . Springer Verlag , 2001 . A. Mantler and J. Snoeyink. Intersecting red and blue line segments in optimal time and precision. In Discrete and Computational Geometry, number 2098 in LNCS, pages 244--251. Springer Verlag, 2001."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177156"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03367-4_43"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009321"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.163412"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00040-2"},{"key":"e_1_3_2_1_24_1","first-page":"927","volume-title":"Handbook of Discrete and Computational Geometry","author":"Yap C. K.","year":"2004","unstructured":"C. K. Yap . Robust geometric computation . In Handbook of Discrete and Computational Geometry , pages 927 -- 952 . CRC Press, Inc. , Boca Raton, FL, USA , 2 nd edition, 2004 . C. K. Yap. Robust geometric computation. In Handbook of Discrete and Computational Geometry, pages 927--952. CRC Press, Inc., Boca Raton, FL, USA, 2nd edition, 2004.","edition":"2"}],"event":{"name":"SoCG '10: Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Snowbird Utah USA","acronym":"SoCG '10"},"container-title":["Proceedings of the twenty-sixth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1811024","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810959.1811024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:02Z","timestamp":1750245782000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1811024"}},"subtitle":["a further example of degree-driven algorithm design"],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":23,"alternative-id":["10.1145\/1810959.1811024","10.1145\/1810959"],"URL":"https:\/\/doi.org\/10.1145\/1810959.1811024","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}