{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:21:37Z","timestamp":1758846097571,"version":"3.44.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0097-8493(02)00090-0","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T16:40:59Z","timestamp":1027874459000},"page":"477-490","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["Improvements to randomized incremental Delaunay insertion"],"prefix":"10.1016","volume":"26","author":[{"given":"Ivana","family":"Kolingerov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borut","family":"\u017dalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0097-8493(02)00090-0_BIB1","doi-asserted-by":"crossref","unstructured":"Cignoni P, Montani C, Perego R, Scopigno R. Parallel 3D Delaunay Triangulation, Proceedings of Eurographics\u201993, p. C129\u201342.","DOI":"10.1111\/1467-8659.1230129"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB2","doi-asserted-by":"crossref","unstructured":"Shewchuk JR. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In: Lin MC, Manocha D, editors. Applied computational geometry towards geometric engineering, vol. 1148. Lecture Notes in Computer Scinece. Berlin: Springer, May 1996. p. 203\u201322.","DOI":"10.1007\/BFb0014497"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB3","doi-asserted-by":"crossref","unstructured":"Su P, Drysdale RLS. A comparison of sequential Delaunay triangulation algorithms. In: Proceedings of the 11th Annual Symposium on Computational Geometry. New York: ACM, June 1995. p. 61\u201370.","DOI":"10.1145\/220279.220286"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB4","doi-asserted-by":"crossref","unstructured":"Dwyer RA. A simple divide-and-conquer algorithm for constructing Delaunay triangulation in O(nloglogn) expected time. In: Proceedings of the 2nd Annual Symposium on Comp. Geom. New York: ACM, 1986. p. 276\u201384.","DOI":"10.1145\/10515.10545"},{"year":"1997","series-title":"Computational geometry, algorithms and applications","author":"de Berg","key":"10.1016\/S0097-8493(02)00090-0_BIB5"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","article-title":"Randomized incremental construction of Delaunay and Voronoi diagrams","volume":"7","author":"Guibas","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A Sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"issue":"5","key":"10.1016\/S0097-8493(02)00090-0_BIB8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","article-title":"Voronoi diagrams from convex hulls","volume":"9","author":"Brown","year":"1979","journal-title":"Inf Proc Lett"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0097-8493(96)00085-4","article-title":"An improved incremental algorithm for constructing restricted Delaunay triangulations","volume":"21","author":"Vigo","year":"1997","journal-title":"Comput Graphics"},{"year":"1992","series-title":"Spatial tesselations","author":"Okabe","key":"10.1016\/S0097-8493(02)00090-0_BIB10"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0097-8493(99)00153-3","article-title":"Computing directional constrained Delaunay triangulations","volume":"24","author":"Vigo","year":"2000","journal-title":"Comput Graphics"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0167-8396(91)90038-D","article-title":"Construction of three-dimensional Delaunay triangulations using local transformations","volume":"8","author":"Joe","year":"1991","journal-title":"Comput Aided Geometric Design"},{"issue":"1","key":"10.1016\/S0097-8493(02)00090-0_BIB13","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0141-1195(87)90043-X","article-title":"A fast algorithm for constructing Delaunay triangulations in the plane","volume":"9","author":"Sloan","year":"1987","journal-title":"Adv Eng Software"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB14","series-title":"Handbook of discrete and computational geometry","first-page":"559","article-title":"Point location","author":"Snoeyink","year":"1997"},{"issue":"2","key":"10.1016\/S0097-8493(02)00090-0_BIB15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans Graphics"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB16","doi-asserted-by":"crossref","unstructured":"M\u00fccke EP, Saias I, Zhu B. Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. CompGeom\u201996, Philadelphia, 1996. p. 274\u201383.","DOI":"10.1145\/237218.237396"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB17","doi-asserted-by":"crossref","unstructured":"Mulmuley K. Randomized multidimensional search trees: dynamic sampling. In: Proceedings of the 7th Annual ACM Symposium on Computational Geometry, 1991. p. 121\u201331.","DOI":"10.1145\/109648.109662"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB18","doi-asserted-by":"crossref","unstructured":"Devillers O. Improved incremental randomized Delaunay triangulation. ACM Symposium on Computational Geometry. Minneapolis, USA, 1998. p. 106\u201315.","DOI":"10.1145\/276884.276896"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB19","first-page":"306","article-title":"Improvements of the incremental method for the Voronoi diagram with computational comparison of various algorithms","volume":"27","author":"Ohya","year":"1984","journal-title":"J Oper Res Soc Japan"},{"issue":"3","key":"10.1016\/S0097-8493(02)00090-0_BIB20","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams\u2014a survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Comput Survey"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB21","doi-asserted-by":"crossref","unstructured":"\u017dalik B, Kolingerov\u00e1 I, Podgorelec D. An incremental insertion algorithm for Delaunay triangulation using the nearest-point paradigm. Int J Geographical Inform Sci 2002, submitted for publication.","DOI":"10.1080\/713811749"},{"year":"1994","series-title":"Computational geometry in C","author":"O\u2019Rourke","key":"10.1016\/S0097-8493(02)00090-0_BIB22"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB23","unstructured":"http:\/\/www.cs.cmu.edu\/\u223cquake\/triangle.html"},{"key":"10.1016\/S0097-8493(02)00090-0_BIB24","unstructured":"Farin G, Hansford D. The geometry toolbox for graphics and modeling. MA: A.K. Peters, 1998."}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849302000900?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849302000900?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T17:17:59Z","timestamp":1758820679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849302000900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0097849302000900"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(02)00090-0","relation":{},"ISSN":["0097-8493"],"issn-type":[{"type":"print","value":"0097-8493"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improvements to randomized incremental Delaunay insertion","name":"articletitle","label":"Article Title"},{"value":"Computers & Graphics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0097-8493(02)00090-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}