{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:13:06Z","timestamp":1766268786924,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341908"},{"type":"electronic","value":"9783642341915"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34191-5_25","type":"book-chapter","created":{"date-parts":[[2012,11,11]],"date-time":"2012-11-11T19:57:47Z","timestamp":1352663867000},"page":"258-273","source":"Crossref","is-referenced-by-count":3,"title":["Meshes Preserving Minimum Feature Size"],"prefix":"10.1007","author":[{"given":"Greg","family":"Aloupis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Aloupis, G., Demaine, E., Demaine, M., Dujmovic, V., Iacono, J.: Meshes preserving minimum feature size. Technical report arXiv:0908:2493 (2011)","DOI":"10.1007\/978-3-642-34191-5_25"},{"issue":"1-2","key":"25_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. Interational Journal of Computational Geometry & Applications\u00a05(1-2), 171\u2013192 (1995)","journal-title":"Interational Journal of Computational Geometry & Applications"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bern, M., Eppstein, D.: Mesh generation and optimal triangulation. In: Du, D.-Z., Hwang, F.K.-M. (eds.) Computing in Euclidean Geometry, 2nd edn. Lecture Notes Series on Computing, vol.\u00a04, pp. 47\u2013123. World Scientific (1995)","DOI":"10.1142\/9789812831699_0003"},{"key":"25_CR4","unstructured":"Dey, T.K.: Delaunay mesh generation of three dimensional domains. Technical Report OSU-CISRC-09\/07-TR64, Ohio State University (October 2007)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Erickson, J.: Nice point sets can have nasty delaunay triangulations. Discrete & Computational Geometry\u00a030(1) (July 2003)","DOI":"10.1007\/s00454-003-2927-4"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N.: Dissections: Plane and Fancy. Cambridge University Press (November 1997)","DOI":"10.1017\/CBO9780511574917"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Hudson, B., Miller, G., Phillips, T.: Sparse Voronoi Refinement. In: Proceedings of the 15th International Meshing Roundtable, Birmingham, Alabama, pp. 339\u2013356. Springer (September 2006)","DOI":"10.1007\/978-3-540-34958-7_20"},{"key":"25_CR8","unstructured":"Lowry: Solution to question 269, [proposed] by Wallace, W. In: Leybourn, T. (ed.) Mathematical Repository, vol.\u00a03, part 1, pp. 44\u201346. W. Glendinning, London (1814)"},{"key":"25_CR9","unstructured":"Ruppert, J.: A new and simple algorithm for quality 2-dimensional mesh generation. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, pp. 83\u201392 (1993)"},{"key":"25_CR10","unstructured":"Shewchuk, J.R.: Theoretically guaranteed Delaunay mesh generation\u2014in practice. Short course at 13th International Meshing Roundtable (2004), \n                  \n                    http:\/\/www.cs.berkeley.edu\/~jrs\/papers\/imrtalk.pdf"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34191-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:07:44Z","timestamp":1558300064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34191-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341908","9783642341915"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34191-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}