{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:35:46Z","timestamp":1765038946481,"version":"build-2065373602"},"reference-count":27,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,5,19]],"date-time":"1998-05-19T00:00:00Z","timestamp":895536000000},"content-version":"vor","delay-in-days":413,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0925-7721(96)00025-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"361-385","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":79,"title":["A comparison of sequential Delaunay triangulation algorithms"],"prefix":"10.1016","volume":"7","author":[{"given":"Peter","family":"Su","sequence":"first","affiliation":[]},{"given":"Robert L.","family":"Scot Drysdale","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(96)00025-9_BIB1","series-title":"Proc. ACM Sympos. Theory Comput.","first-page":"600","article-title":"Uniform memory hierarchies","author":"Alpern","year":"1990"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB2","article-title":"Computational geometry with imprecise data and arithmetic","author":"Barber","year":"1993","journal-title":"Ph.D. Thesis"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB3","series-title":"Proc. 6th Ann. ACM Sympos. Comput. Geom.","first-page":"187","article-title":"K-d trees for semidynamic point sets","author":"Bentley","year":"1990"},{"issue":"4","key":"10.1016\/S0925-7721(96)00025-9_BIB4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","article-title":"Optimal expected time algorithms for closest point problems","volume":"6","author":"Bentley","year":"1980","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(93)90024-N","article-title":"On the randomized construction of the Delaunay tree","volume":"112","author":"Boissonnat","year":"1993","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0925-7721(96)00025-9_BIB6","first-page":"223","article-title":"Voronoi diagrams from convex hulls","author":"Brown","year":"1979"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00025-9_BIB8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01840356","article-title":"A faster divide-and-conquer algorithm for constructing Delaunay triangulations","volume":"2","author":"Dwyer","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02574694","article-title":"Higher-dimensional Voronoi diagrams in linear expected time","volume":"6","author":"Dwyer","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00025-9_BIB10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","article-title":"Voronoi diagrams and arrangements","volume":"1","author":"Edelsbrunner","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00025-9_BIB11","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"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB12","series-title":"Proc. IEEE Sympos. Found. Comput. Sci.","first-page":"494","article-title":"Stable maintenance of point-set triangulations in two dimensions","author":"Fortune","year":"1989"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB13","series-title":"Proc. Ann. ACM Sympos. Comput. Geom.","article-title":"Numerical stability of algorithms for Delaunay triangulations and Voronoi diagrams","author":"Fortune","year":"1992"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB14","series-title":"Proc. 34th Sympos. Found. Comput. Sci.","article-title":"External-memory computational geometry","author":"Goodrich","year":"1993"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB15","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1093\/comjnl\/21.2.168","article-title":"Computing Dirichlet tessellations in the plane","volume":"21","author":"Green","year":"1977","journal-title":"Comput. J."},{"key":"10.1016\/S0925-7721(96)00025-9_BIB16","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"},{"issue":"2","key":"10.1016\/S0925-7721(96)00025-9_BIB17","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"},{"year":"1987","series-title":"Constructing Delaunay triangulations by merging buckets in quad-tree order","author":"Katajainen","key":"10.1016\/S0925-7721(96)00025-9_BIB18"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB19","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01937482","article-title":"Delaunay triangulation and the convex hull of n points in expected linear time","author":"Maus","year":"1984","journal-title":"BIT 24"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB20","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"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"year":"1976","series-title":"Integral Geometry and Geometric Probability","author":"Santal\u00f3","key":"10.1016\/S0925-7721(96)00025-9_BIB22"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB23","series-title":"Proc. Ann. ACM Sympos. Comput. Geom.","article-title":"Randomized incremental construction of Delaunay diagrams: Theory and practice","author":"Sharir","year":"1991"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB24","series-title":"Technical Report","article-title":"Efficient parallel algorithms for closest point problems","author":"Su","year":"1994"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB25","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0021-9991(83)90087-6","article-title":"A new algorithm for three dimensional Voronoi tessellation","volume":"51","author":"Tanemura","year":"1983","journal-title":"J. Comput. Phys."},{"key":"10.1016\/S0925-7721(96)00025-9_BIB26","series-title":"Proc. Ann. Sympos. Theor. Comput. Sci.","article-title":"Efficient memory access in large-scale computation","author":"Vitter","year":"1991"},{"key":"10.1016\/S0925-7721(96)00025-9_BIB27","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/BF01185207","article-title":"Optimal algorithms for parallel memory I: Two-level memories","volume":"12","author":"Vitter","year":"1994","journal-title":"Algorithmica"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000259?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000259?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:47:52Z","timestamp":1760428072000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772196000259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":27,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0925772196000259"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(96)00025-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[1997,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A comparison of sequential Delaunay triangulation algorithms","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0925-7721(96)00025-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}