{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:01Z","timestamp":1759626601213,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3978,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00407-8","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T15:19:50Z","timestamp":1034954390000},"page":"879-895","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximating uniform triangular meshes in polygons"],"prefix":"10.1016","volume":"289","author":[{"given":"Franz","family":"Aurenhammer","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Hiromichi","family":"Kojima","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Ohsaki","sequence":"additional","affiliation":[]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00407-8_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 Comput. Surveys"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1142\/S0218195995000106","article-title":"Triangulating polygons without large angles","volume":"5","author":"Bern","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0304-3975(01)00407-8_BIB3","series-title":"Computing in Euclidean Geometry","first-page":"47","article-title":"Mesh generation and optimal triangulation","author":"Bern","year":"1992"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB4","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."},{"key":"10.1016\/S0304-3975(01)00407-8_BIB5","doi-asserted-by":"crossref","unstructured":"M. Bern, S. Mitchell, J. Ruppert, Linear-size nonobtuse triangulation of polygons, Proc. 10th Ann. ACM Symp. on Computational Geometry, 1994, pp. 221\u2013230.","DOI":"10.1145\/177424.177974"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB6","doi-asserted-by":"crossref","unstructured":"P. Chew, Guaranteed-quality mesh generation for curved surfaces, Proc. 9th Ann. ACM Symp. on Computational Geometry, 1993, pp. 274\u2013280.","DOI":"10.1145\/160985.161150"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/0222036","article-title":"A quadratic time algorithm for the minmax length triangulation","volume":"22","author":"Edelsbrunner","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00407-8_BIB8","doi-asserted-by":"crossref","unstructured":"T. Feder, D.H. Greene, Optimal algorithms for approximate clustering, Proc. 20th Ann. ACM Symp. STOC, 1988, pp. 434\u2013444.","DOI":"10.1145\/62212.62255"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB9","first-page":"19","article-title":"Packing and covering","author":"Fejes T\u00f3th","year":"1997"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38","author":"Gonzalez","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00407-8_BIB11","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","article-title":"Approximation schemes for covering and packing problems in image processing and VLSI","volume":"32","author":"Hochbaum","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB12","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","article-title":"The NP-completeness column","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB13","doi-asserted-by":"crossref","unstructured":"N. Katoh, H. Kojima, R. Taniguchi, Approximating uniform triangular meshes on spheres, Proc. JCDCG 2000, Lecture Notes in Computer Science, Vol. 2098, Springer, Berlin, 2001, pp. 192\u2013204.","DOI":"10.1007\/3-540-47738-1_18"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","article-title":"Generalized Delaunay triangulation for planar graphs","volume":"1","author":"Lee","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(01)00407-8_BIB15","doi-asserted-by":"crossref","unstructured":"E. Melisseratos, D. Souvaine, Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes, Proc. 8th Ann. ACM Symp. on Computational Geometry, 1992, pp. 202\u2013211.","DOI":"10.1145\/142675.142719"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB16","first-page":"165","article-title":"The traviation process","volume":"38","author":"Nooshin","year":"1997","journal-title":"J. Internat. Assoc. Shell Spatial Struct."},{"key":"10.1016\/S0304-3975(01)00407-8_BIB17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1177\/026635119701200205","article-title":"Shape optimization of a double-layer space truss described by a parametric surface","volume":"12","author":"Ohsaki","year":"1997","journal-title":"Internat. J. Space Structures"},{"key":"10.1016\/S0304-3975(01)00407-8_BIB18","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1112\/jlms\/s1-26.3.198","article-title":"On a problem of Heilbronn","volume":"26","author":"Roth","year":"1951","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0304-3975(01)00407-8_BIB19","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:20Z","timestamp":1759625540000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501004078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501004078"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00407-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximating uniform triangular meshes in polygons","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(01)00407-8","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 B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}