{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:46Z","timestamp":1750307806990,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"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":[[2008,6,9]]},"DOI":"10.1145\/1377676.1377727","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"298-304","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Delaunay triangulations of imprecise pointsin linear time after preprocessing"],"prefix":"10.1145","author":[{"given":"Maarten","family":"L\u00f6ffler","sequence":"first","affiliation":[{"name":"Utrecht University, Utrecht, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[{"name":"UNC Chapel Hill, Chapel Hill, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00107-6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187749"},{"key":"e_1_3_2_1_3_1","first-page":"403","volume-title":"ACM-SIAM Symp on Discrete Algorithms","author":"Bandyopadhyay D.","year":"2004","unstructured":"D. Bandyopadhyay and J. Snoeyink . Almost-Delaunay simplices: Nearest neighbor relations for imprecise points . In ACM-SIAM Symp on Discrete Algorithms , pages 403 -- 412 , 2004 . D. Bandyopadhyay and J. Snoeyink. Almost-Delaunay simplices: Nearest neighbor relations for imprecise points. In ACM-SIAM Symp on Discrete Algorithms, pages 403--412, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2006.11.003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-540-24738-8_9","volume-title":"Numerical Software with Result Verification, number 2991 in LNCS","author":"B\u00fchler K.","year":"2004","unstructured":"K. B\u00fchler , E. Dyllong , and W. Luther . Reliable distance and intersection computation using finite precision geometry . In Numerical Software with Result Verification, number 2991 in LNCS , pages 160 -- 190 . Springer Verlag , 2004 . K. B\u00fchler, E. Dyllong, and W. Luther. Reliable distance and intersection computation using finite precision geometry. In Numerical Software with Result Verification, number 2991 in LNCS, pages 160--190. Springer Verlag, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2003.09.005"},{"key":"e_1_3_2_1_7_1","unstructured":"Cgal Computational Geometry Algorithms Library. http:\/\/www.cgal.org.  Cgal Computational Geometry Algorithms Library. http:\/\/www.cgal.org."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574703"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009429"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795285916"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/77635.77639"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009977923779"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000118"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2412323"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/177424.177572"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00050-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/73833.73857"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190154"},{"key":"e_1_3_2_1_20_1","first-page":"94","volume-title":"Proc. 15th Canad. Conf. Comput. Geom.","author":"Khanban A. A.","year":"2003","unstructured":"A. A. Khanban and A. Edalat . Computing Delaunay triangulation with imprecise input data . In Proc. 15th Canad. Conf. Comput. Geom. , pages 94 -- 97 , 2003 . A. A. Khanban and A. Edalat. Computing Delaunay triangulation with imprecise input data. In Proc. 15th Canad. Conf. Comput. Geom., pages 94--97, 2003."},{"key":"e_1_3_2_1_21_1","volume-title":"Electronic Notes in Theoretical Computer Science","author":"Khanban A. A.","year":"2002","unstructured":"A. A. Khanban , A. Edalat , and A. Lieutier . Computability of partial Delaunay triangulation and Voronoi diagram . In V. Brattka, M. Schr\u00f6der, and K. Weihrauch, editors, Electronic Notes in Theoretical Computer Science , volume 66 . Elsevier , 2002 . A. A. Khanban, A. Edalat, and A. Lieutier. Computability of partial Delaunay triangulation and Voronoi diagram. In V. Brattka, M. Schr\u00f6der, and K. Weihrauch, editors, Electronic Notes in Theoretical Computer Science, volume 66. Elsevier, 2002."},{"key":"e_1_3_2_1_22_1","volume-title":"Algorithmica","author":"L\u00f6ffler M.","year":"2008","unstructured":"M. L\u00f6ffler and M. van Kreveld . Largest and smallest convex hulls for imprecise points . Algorithmica , 2008 (to appear). M. L\u00f6ffler and M. van Kreveld. Largest and smallest convex hulls for imprecise points. Algorithmica, 2008 (to appear)."},{"key":"e_1_3_2_1_23_1","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"Mehlhorn K.","year":"2000","unstructured":"K. Mehlhorn and S. N\u00e4her . LEDA: A Platform for Combinatorial and Geometric Computing . Cambridge University Press , Cambridge, UK , 2000 . K. Mehlhorn and S. N\u00e4her. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-87806-9.50017-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00047-5"},{"key":"e_1_3_2_1_26_1","volume-title":"July","author":"Specht E.","year":"2007","unstructured":"E. Specht . The best known packings of equal circles in the unit circle (up to n = 500). http:\/\/hydra.nat.uni-magdeburg.de\/packing\/cci\/cci.html , July 2007 . E. Specht. The best known packings of equal circles in the unit circle (up to n = 500). http:\/\/hydra.nat.uni-magdeburg.de\/packing\/cci\/cci.html, July 2007."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0893-9659(89)90022-0"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.163412"},{"key":"e_1_3_2_1_29_1","first-page":"447","volume-title":"Proc. 10th Workshop on Algorithms and Data Structures, LNCS 4619","author":"van Kreveld M.","year":"2007","unstructured":"M. van Kreveld and M. L\u00f6ffler . Largest bounding box, smallest diameter, and related problems on imprecise points . In Proc. 10th Workshop on Algorithms and Data Structures, LNCS 4619 , pages 447 -- 458 , 2007 . M. van Kreveld and M. L\u00f6ffler. Largest bounding box, smallest diameter, and related problems on imprecise points. In Proc. 10th Workshop on Algorithms and Data Structures, LNCS 4619, pages 447--458, 2007."},{"key":"e_1_3_2_1_30_1","first-page":"251","volume-title":"Proc. 9th Canad. Conf. Comput. Geom.","author":"Weller F.","year":"1997","unstructured":"F. Weller . Stability of Voronoi neighborship under perturbations of the sites . In Proc. 9th Canad. Conf. Comput. Geom. , pages 251 -- 256 , 1997 . F. Weller. Stability of Voronoi neighborship under perturbations of the sites. In Proc. 9th Canad. Conf. Comput. Geom., pages 251--256, 1997."},{"key":"e_1_3_2_1_31_1","first-page":"927","volume-title":"J. E. Goodman and J. O'Rourke","author":"Yap C.","year":"2004","unstructured":"C. Yap . Robust geometric computation . In J. E. Goodman and J. O'Rourke , editors, Handbook of Discrete and Computational Geometry, Second Edition , pages 927 -- 952 . CRC Press , 2004 . C. Yap. Robust geometric computation. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, Second Edition, pages 927--952. CRC Press, 2004."}],"event":{"name":"SoCG08: 24th Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"College Park MD USA","acronym":"SoCG08"},"container-title":["Proceedings of the twenty-fourth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377727","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1377676.1377727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:39Z","timestamp":1750254999000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":30,"alternative-id":["10.1145\/1377676.1377727","10.1145\/1377676"],"URL":"https:\/\/doi.org\/10.1145\/1377676.1377727","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}