{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:37:58Z","timestamp":1725496678470},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_3","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"23-33","source":"Crossref","is-referenced-by-count":1,"title":["Approximating Uniform Triangular Meshes in Polygons"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer, \u201cVoronoi diagrams-a survey of a fundamental geometric data structure\u201d, ACM Computing Surveys 23 (1991), 345\u2013405.","journal-title":"ACM Computing Surveys"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/S0218195995000106","volume":"5","author":"M. Bern","year":"1995","unstructured":"M. Bern, D. Dobkin and D. Eppstein, \u201cTriangulating polygons without large angles\u201d, Intl. J. Comput. Geom. and Appl. 5 (1995), 171\u2013192.","journal-title":"Intl. J. Comput. Geom. and Appl."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"M. Bern and D. Eppstein, \u201cMesh generation and optimal triangulation\u201d, in D.-Z. Du (ed.), Computing in Euclidean Geometry, World Scientific Publishing, 1992, 47\u2013123.","DOI":"10.1142\/9789812831699_0003"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(05)80059-5","volume":"48","author":"M. Bern","year":"1994","unstructured":"M. Bern, D. Eppstein and J.R. Gilbert, \u201cProvably good mesh generation\u201d, Journal of Computer and System Sciences 48 (1994), 384\u2013409.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"M. Bern, S. Mitchell and J. Ruppert, \u201cLinear-size nonobtuse triangulation of polygons\u201d, Proceedings of the 10th Ann. ACM Symposium on Computational Geometry (1994), 221\u2013230.","DOI":"10.1145\/177424.177974"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"P. Chew, \u201cGuaranteed-QualityMesh Generation for Curved Surfaces\u201d, Proceedings of the 9th Ann. ACM Symposium on Computational Geometry (1993), 274\u2013280.","DOI":"10.1145\/160985.161150"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1137\/0222036","volume":"22","author":"H. Edelsbrunner","year":"1993","unstructured":"H. Edelsbrunner and T.S. Tan, \u201cA quadratic time algorithm for the minmax length triangulation\u201d, SIAM Journal on Computing 22 (1993), 527\u2013551.","journal-title":"SIAM Journal on Computing"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"T. Feder and D.H. Greene, \u201cOptimal Algorithms for Approximate Clustering\u201d, Proceedings of the 20th Ann. ACM Symposium STOC (1988), 434\u2013444.","DOI":"10.1145\/62212.62255"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. Gonzalez","year":"1985","unstructured":"T. Gonzalez, \u201cClustering to minimize the maximum intercluster distance\u201d, Theoretical Computer Science 38 (1985), 293\u2013306.","journal-title":"Theoretical Computer Science"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","volume":"3","author":"D.S. Johnson","year":"1982","unstructured":"D.S. Johnson, \u201cThe NP-completeness column: An ongoing guide\u201d, Journal of Algorithms 3 (1982), 182\u2013195.","journal-title":"Journal of Algorithms"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"E. Melisseratos and D. Souvaine, \u201cCoping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes\u201d, Proceedings of the 8th Ann. ACM Symposium on Computational Geometry (1992), 202\u2013211.","DOI":"10.1145\/142675.142719"},{"key":"3_CR12","first-page":"165","volume":"38","author":"H. Nooshin","year":"1997","unstructured":"H. Nooshin, K. Ishikawa, P.L. Disney and J.W. Butterworth, \u201cThe traviation process\u201d, Journal of the International Association for Shell and Spatial Structures 38 (1997), 165\u2013175.","journal-title":"Journal of the International Association for Shell and Spatial Structures"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1177\/026635119701200205","volume":"12","author":"M. Ohsaki","year":"1997","unstructured":"M. Ohsaki, T. Nakamura and M. Kohiyama, \u201cShape optimization of a double-layer space truss described by a parametric surface\u201d, International Journal of Space Structures 12 (1997), 109\u2013119.","journal-title":"International Journal of Space Structures"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1112\/jlms\/s1-26.3.198","volume":"26","author":"K.F. Roth","year":"1951","unstructured":"K.F. Roth, \u201cOn a problem of Heilbronn\u201d, Proc. London Mathematical Society 26 (1951), 198\u2013204.","journal-title":"Proc. London Mathematical Society"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1006\/jagm.1995.1021","volume":"18","author":"J. Ruppert","year":"1995","unstructured":"J. Ruppert, \u201cA Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation\u201d, Journal of Algorithms 18 (1995), 548\u2013585.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T04:17:12Z","timestamp":1557029832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}