{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T01:16:38Z","timestamp":1773969398202,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6041,"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":[[1997,1]]},"DOI":"10.1016\/0925-7721(95)00046-1","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"93-111","source":"Crossref","is-referenced-by-count":5,"title":["Approximating the maxmin-angle covering triangulation"],"prefix":"10.1016","volume":"7","author":[{"given":"Scott A.","family":"Mitchell","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00046-1_BIB1","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 Computing Surveys"},{"key":"10.1016\/0925-7721(95)00046-1_BIB2","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. Num. Anal."},{"key":"10.1016\/0925-7721(95)00046-1_BIB3","series-title":"Proc. 9th Symp. on Computational Geometry","first-page":"281","article-title":"Compatible tetrahedralizations","author":"Bern","year":"1993"},{"key":"10.1016\/0925-7721(95)00046-1_BIB4","series-title":"Computing in Euclidean Geometry","article-title":"Mesh generation and optimal triangulation","author":"Bern","year":"1992"},{"key":"10.1016\/0925-7721(95)00046-1_BIB5","series-title":"Proc. 31st Symp. Found. Comp. Sci.","first-page":"231","article-title":"Provably good mesh generation","author":"Bern","year":"1990"},{"key":"10.1016\/0925-7721(95)00046-1_BIB6","article-title":"Guaranteed-quality triangular meshes","author":"Chew","year":"1989","journal-title":"C.S. Cornell, TR 89-983"},{"key":"10.1016\/0925-7721(95)00046-1_BIB7","series-title":"Computing in Euclidean Geometry","article-title":"Voronoi diagrams and Delaunay triangulations","author":"Fortune","year":"1992"},{"key":"10.1016\/0925-7721(95)00046-1_BIB8","first-page":"161","article-title":"Software for C1 surface interpolation","volume":"III","author":"Lawson","year":"1977"},{"key":"10.1016\/0925-7721(95)00046-1_BIB9","article-title":"Mesh generation with provable quality bounds","author":"Mitchell","year":"1993","journal-title":"Ph.D. thesis"},{"key":"10.1016\/0925-7721(95)00046-1_BIB10","series-title":"Proc. Fifth Canadian Conference on Computational Geometry","first-page":"36","article-title":"Approximating the maxmin-angle covering triangulation","author":"Mitchell","year":"1993"},{"key":"10.1016\/0925-7721(95)00046-1_BIB11","series-title":"Finding a covering triangulation whose maximum angle is provably small","author":"Mitchell","year":"1993"},{"key":"10.1016\/0925-7721(95)00046-1_BIB12","series-title":"Proc. 8th Symp. on Computational Geometry","first-page":"212","article-title":"Quality mesh generation in three dimensions","author":"Mitchell","year":"1992"},{"key":"10.1016\/0925-7721(95)00046-1_BIB13","series-title":"Proc. 4th ACM-SIAM Symp. Disc. Algorithms","first-page":"83","article-title":"A new and simple algorithm for quality 2-dimensional mesh generation","author":"Ruppert","year":"1993"},{"key":"10.1016\/0925-7721(95)00046-1_BIB14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01451597","article-title":"\u00dcber die Zerlegung von Dreieckspolyedern in Tetraeder","volume":"98","author":"Sch\u00f6nhardt","year":"1928","journal-title":"Math. Annalen"},{"key":"10.1016\/0925-7721(95)00046-1_BIB15","series-title":"1978\u20131988 Ten Years IIG","first-page":"178","article-title":"Constrained Delaunay triangulations and Voronoi diagrams with obstacles","author":"Seidel","year":"1988"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T01:55:24Z","timestamp":1556675724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["0925772195000461"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00046-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}