{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T09:31:28Z","timestamp":1780479088426,"version":"3.54.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4095,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0925-7721(01)00047-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:26:50Z","timestamp":1027607210000},"page":"21-74","source":"Crossref","is-referenced-by-count":900,"title":["Delaunay refinement algorithms for triangular mesh generation"],"prefix":"10.1016","volume":"22","author":[{"given":"Jonathan Richard","family":"Shewchuk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0925-7721(01)00047-5_BIB001","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0713021","article-title":"On the angle condition in the finite element method","volume":"13","author":"Babu\u0161ka","year":"1976","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"10.1016\/S0925-7721(01)00047-5_BIB002","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02187904","article-title":"Nonobtuse triangulation of polygons","volume":"3","author":"Baker","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00047-5_BIB003","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB004","series-title":"Computing in Euclidean Geometry","first-page":"23","article-title":"Mesh generation and optimal triangulation","volume":"1","author":"Bern","year":"1992"},{"issue":"3","key":"10.1016\/S0925-7721(01)00047-5_BIB005","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(05)80059-5","article-title":"Provably good mesh generation","volume":"48","author":"Bern","year":"1994","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0925-7721(01)00047-5_BIB006","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1093\/comjnl\/24.2.162","article-title":"Computing Dirichlet tessellations","volume":"24","author":"Bowyer","year":"1981","journal-title":"Computer J."},{"key":"10.1016\/S0925-7721(01)00047-5_BIB007","series-title":"Finite Elements: Computational Aspects","author":"Carey","year":"1984"},{"issue":"1","key":"10.1016\/S0925-7721(01)00047-5_BIB008","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","article-title":"Constrained Delaunay triangulations","volume":"4","author":"Chew","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB009","series-title":"Guaranteed-quality triangular meshes, Tech. Rept. TR-89-983","author":"Chew","year":"1989"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB010","series-title":"Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, San Diego, CA","first-page":"274","article-title":"Guaranteed-quality mesh generation for curved surfaces","author":"Chew","year":"1993"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB011","series-title":"Proceedings of the Thirteenth Annual ACM Symposium on Computational Geometry","first-page":"391","article-title":"Guaranteed-quality Delaunay meshing in 3D","author":"Chew","year":"1997"},{"issue":"1","key":"10.1016\/S0925-7721(01)00047-5_BIB012","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."},{"issue":"1","key":"10.1016\/S0925-7721(01)00047-5_BIB013","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1142\/S0218195992000068","article-title":"On good triangulations in three dimensions","volume":"2","author":"Dey","year":"1992","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(01)00047-5_BIB014","series-title":"Proceedings of the Fifteenth Annual ACM Symposium on Computational Geometry","first-page":"181","article-title":"On deletion in Delaunay triangulations","author":"Devillers","year":"1999"},{"issue":"2","key":"10.1016\/S0925-7721(01)00047-5_BIB015","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"},{"issue":"11","key":"10.1016\/S0925-7721(01)00047-5_BIB016","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1002\/nme.1620241111","article-title":"Selective refinement: A new strategy for automatic node placement in graded triangular meshes","volume":"24","author":"Frey","year":"1987","journal-title":"Internat. J. Numer. Methods Engrg."},{"issue":"2","key":"10.1016\/S0925-7721(01)00047-5_BIB017","doi-asserted-by":"crossref","first-page":"74","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\/S0925-7721(01)00047-5_BIB018","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0168-874X(96)00039-X","article-title":"Adaptive refinement of unstructured finite-element meshes","volume":"25","author":"Jones","year":"1997","journal-title":"Finite Elements in Analysis and Design"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB019","series-title":"Mathematical Software III","first-page":"161","article-title":"Software for C1 surface interpolation","author":"Lawson","year":"1977"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB020","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","article-title":"Generalized Delaunay triangulations for planar graphs","volume":"1","author":"Lee","year":"1986","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"10.1016\/S0925-7721(01)00047-5_BIB021","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","article-title":"Two algorithms for constructing a Delaunay triangulation","volume":"9","author":"Lee","year":"1980","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/S0925-7721(01)00047-5_BIB022","series-title":"Proceedings of the Eighth Annual ACM Symposium on Discrete Algorithms, New Orleans, LA","first-page":"538","article-title":"Optimal good-aspect-ratio coarsening for unstructured meshes","author":"Miller","year":"1997"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB023","series-title":"Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, Las Vegas, NV","first-page":"683","article-title":"A Delaunay based numerical method for three dimensions: Generation, formulation, and partition","author":"Miller","year":"1995"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB024","series-title":"Proceedings of the Sixth Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan, Canada","first-page":"326","article-title":"Cardinality bounds for triangulations with bounded minimum angle","author":"Mitchell","year":"1994"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB025","series-title":"A new and simple algorithm for quality 2-dimensional mesh generation, Tech. Rept. UCB\/CSD 92\/694","author":"Ruppert","year":"1992"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB026","series-title":"Proceedings of the Fourth Annual ACM Symposium on Discrete Algorithms","first-page":"83","article-title":"A new and simple algorithm for quality 2-dimensional mesh generation","author":"Ruppert","year":"1993"},{"issue":"3","key":"10.1016\/S0925-7721(01)00047-5_BIB027","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1006\/jagm.1995.1021","article-title":"A Delaunay refinement algorithm for quality 2-dimensional mesh generation","volume":"18","author":"Ruppert","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB028","series-title":"Backwards analysis of randomized geometric algorithms, Tech. Rept. TR-92-014","author":"Seidel","year":"1992"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB029","series-title":"Applied Computational Geometry: Towards Geometric Engineering, First ACM Workshop on Applied Computational Geometry","first-page":"203","article-title":"Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator","volume":"1148","author":"Shewchuk","year":"1996"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB030","series-title":"Proceedings of the Fourteenth Annual ACM Symposium on Computational Geometry, Minneapolis, MN","first-page":"86","article-title":"Tetrahedral mesh generation by Delaunay refinement","author":"Shewchuk","year":"1998"},{"key":"10.1016\/S0925-7721(01)00047-5_BIB031","series-title":"Proceedings of the Sixteenth Annual ACM Symposium on Computational Geometry, Hong Kong","first-page":"1","article-title":"Mesh generation for domains with small angles","author":"Shewchuk","year":"2000"},{"issue":"2","key":"10.1016\/S0925-7721(01)00047-5_BIB032","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1093\/comjnl\/24.2.167","article-title":"Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes","volume":"24","author":"Watson","year":"1981","journal-title":"Computer J."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000475?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000475?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:54:18Z","timestamp":1556441658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":32,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0925772101000475"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00047-5","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}