{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:59Z","timestamp":1725567059722},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_49","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"481-489","source":"Crossref","is-referenced-by-count":1,"title":["Triangulating a Convex Polygon with Small Number of Non-standard Bars"],"prefix":"10.1007","author":[{"given":"Yinfeng","family":"Xu","sequence":"first","affiliation":[]},{"given":"Wenqiang","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Ohsaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/S0304-3975(01)00407-8","volume":"289","author":"F. Aurenhammer","year":"2002","unstructured":"Aurenhammer, F., Katoh, N., Kojima, H., Ohsaki, M., Xu, Y.F.: Approximating uniform triangular meshes in polygons. Theoretical Computer Science\u00a0289, 879\u2013895 (2002)","journal-title":"Theoretical Computer Science"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/S0218195995000106","volume":"5","author":"M. Bern","year":"1995","unstructured":"Bern, M., Dobkin, D., Eppstein, D.: Triangulating polygons without large angles, Internat. J. Comput. Geom. Appl.\u00a05, 171\u2013192 (1995)","journal-title":"J. Comput. Geom. Appl."},{"key":"49_CR3","first-page":"47","volume-title":"Computing in Euclidean Geometry","author":"M. Bern","year":"1992","unstructured":"Bern, M., Eppstein, D.: Mesh generation and optimal triangulation. In: Du, D.-Z. (ed.) Computing in Euclidean Geometry, pp. 47\u2013123. World Scientific, Singapore (1992)"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(05)80059-5","volume":"48","author":"M. Bern","year":"1994","unstructured":"Bern, M., Eppstein, D., Gilbert, J.R.: Provably good mesh generation. J. Comput. System Sci.\u00a048, 384\u2013409 (1994)","journal-title":"J. Comput. System Sci."},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Bern, M., Mitchell, S., Ruppert, J.: Linear-size nonobtuse triangulation of polygons. In: Proc. 10th Ann. ACM Symp. on Computational Geometry, pp. 221\u2013230 (1994)","DOI":"10.1145\/177424.177974"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Chew, P.: Guaranteed-quality mesh generation for curved surfaces. In: Proc. 9th Ann. ACM Symp. on Computational Geometry, pp. 274\u2013280 (1993)","DOI":"10.1145\/160985.161150"},{"key":"49_CR7","series-title":"EATCS Monographs on Theoretical Cmputer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatiorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatiorial Geometry. EATCS Monographs on Theoretical Cmputer Science, vol.\u00a010. Springer, Heidelberg (1987)"},{"key":"49_CR8","unstructured":"Gilbert, P.D.: New results in planar triangulation, report R-850, Coordinated Science Laboratory, University of Illinois (1979)"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0167-5060(08)70048-7","volume":"9","author":"G.T. Klincsek","year":"1980","unstructured":"Klincsek, G.T.: Minimal triangulations of polygonal domains. Ann. Discrete Math.\u00a09, 127\u2013128 (1980)","journal-title":"Ann. Discrete Math."},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Melisseratos, E., Souvaine, D.: Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes. In: Proc. 8th Ann. ACM Symp. on Computational Geometry, pp. 202\u2013211 (1992)","DOI":"10.1145\/142675.142719"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1006\/jagm.1995.1021","volume":"18","author":"J. Ruppert","year":"1995","unstructured":"Ruppert, J.: A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms\u00a018, 548\u2013585 (1995)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:14:13Z","timestamp":1553138053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11533719_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}