{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:26:13Z","timestamp":1768731973419,"version":"3.49.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":3791,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00437-1","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T17:35:20Z","timestamp":1045071320000},"page":"145-165","source":"Crossref","is-referenced-by-count":30,"title":["Generating well-shaped d-dimensional Delaunay Meshes"],"prefix":"10.1016","volume":"296","author":[{"given":"Xiang-Yang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00437-1_BIB1","unstructured":"M. Bern, P. Chew, D. Eppstein, J. Ruppert, Dihedral bounds for mesh generation in high dimensions, in: Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, ACM, 1995, pp. 189\u2013196."},{"key":"10.1016\/S0304-3975(02)00437-1_BIB2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/nme.1620210210","article-title":"An approach to automatic three-dimensional finite element mesh generation","volume":"21","author":"Cavendish","year":"1985","journal-title":"Internat. J. Numer. Methods Eng."},{"key":"10.1016\/S0304-3975(02)00437-1_BIB3","doi-asserted-by":"crossref","unstructured":"S.W. Cheng, T.K. Dey, H. Edelsbrunner, M.A. Facello, S.H. Teng, Silver exudation, in: Proc. 15th ACM Symp. on Computational Geometry, 1999, pp. 1\u201313.","DOI":"10.1145\/304893.304894"},{"key":"10.1016\/S0304-3975(02)00437-1_BIB4","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\/S0304-3975(02)00437-1_BIB5","doi-asserted-by":"crossref","unstructured":"L.P. Chew, Guaranteed-quality delaunay meshing in 3d (short version), in: 13th ACM Symp. on Computational Geometry, 1997, pp. 391\u2013393.","DOI":"10.1145\/262839.263018"},{"key":"10.1016\/S0304-3975(02)00437-1_BIB6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, X.Y. Li, G. Miller, A. Stathopoulos, D. Talmor, S.H. Teng, A. \u00dcNg\u00d6R\u201d, N. Walkington, Smoothing and cleaning up slivers, in: ACM Symp. on Theory of Computing (STOC00), 2000, pp. 273\u2013277.","DOI":"10.1145\/335305.335338"},{"key":"10.1016\/S0304-3975(02)00437-1_BIB7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01975867","article-title":"Incremental topological flipping works for regular triangulations","volume":"15","author":"Edelsbrunner","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(02)00437-1_BIB8","unstructured":"X.Y. Li, Sliver-free three dimensional delaunay mesh generation, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 2000."},{"key":"10.1016\/S0304-3975(02)00437-1_BIB9","unstructured":"X.Y. Li, S.H. Teng, Sliver-free three dimensional delaunay mesh generation, in: Symp. on Discrete Algorithms (SODA), 2001, pp. 28\u201337."},{"key":"10.1016\/S0304-3975(02)00437-1_BIB10","doi-asserted-by":"crossref","unstructured":"G.L. Miller, D. Talmor, S.H. Teng, N. Walkington, A delaunay based numerical method for three dimensions: generation, formulation, and partition, in: Proc. 27th Annu. ACM Symp. on Theory and Computing 1995, pp. 683\u2013692.","DOI":"10.1145\/225058.225286"},{"key":"10.1016\/S0304-3975(02)00437-1_BIB11","unstructured":"J. Ruppert, A new and simple algorithm for quality 2-dimensional mesh generation, in: Third Annu. ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 83\u201392."},{"key":"10.1016\/S0304-3975(02)00437-1_BIB12","unstructured":"J.R. Shewchuk, Delaunay refinement mesh generation, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1997."},{"key":"10.1016\/S0304-3975(02)00437-1_BIB13","doi-asserted-by":"crossref","unstructured":"J.R. Shewchuk, Tetrahedral mesh generation by delaunay refinement, in: 14th Ann. ACM Symp. on Computational Geometry, 1998, pp. 86\u201395.","DOI":"10.1145\/276884.276894"},{"key":"10.1016\/S0304-3975(02)00437-1_BIB14","unstructured":"D. Talmor, Well-spaced points for numerical methods, Ph.D. Thesis, Carnegie Mellon University, 1997."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004371?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004371?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T05:24:29Z","timestamp":1583990669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502004371"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00437-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}