{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:45Z","timestamp":1725490425801},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_57","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"655-666","source":"Crossref","is-referenced-by-count":0,"title":["Size Competitive Meshing Without Large Angles"],"prefix":"10.1007","author":[{"given":"Gary L.","family":"Miller","sequence":"first","affiliation":[]},{"given":"Todd","family":"Phillips","sequence":"additional","affiliation":[]},{"given":"Donald","family":"Sheehy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"57_CR1","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. Journal of Computer and System Sciences\u00a048(3), 384\u2013409 (1994)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"57_CR2","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(3), 548\u2013585 (1995)","journal-title":"J. Algorithms"},{"key":"57_CR3","first-page":"212","volume-title":"Proc. 8th ACM Symp. Comp. Geom.","author":"S. Mitchell","year":"1992","unstructured":"Mitchell, S., Vavasis, S.: Quality mesh generation in three dimensions. In: Proc. 8th ACM Symp. Comp. Geom., pp. 212\u2013221. ACM Press, New York (1992)"},{"issue":"1\u20133","key":"57_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0925-7721(01)00047-5","volume":"22","author":"J.R. Shewchuk","year":"2002","unstructured":"Shewchuk, J.R.: Delaunay Refinement Algorithms for Triangular Mesh Generation. Computational Geometry: Theory and Applications\u00a022(1\u20133), 21\u201374 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"2","key":"57_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0713021","volume":"13","author":"I. Babu\u0161ka","year":"1976","unstructured":"Babu\u0161ka, I., Aziz, A.K.: On the Angle Condition in the Finite Element Method. SIAM Journal on Numerical Analysis\u00a013(2), 214\u2013226 (1976)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"57_CR6","unstructured":"Guattery, S., Miller, G.L., Walkington, N.: Estimating interpolation error: A combinatorial approach. In: Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, ACM and SIAM, pp. 406\u2013413 (1999)"},{"key":"57_CR7","unstructured":"Boman, E., Hendrickson, B., Vavasis, S.: Solving elliptic finite element systems in near-linear time with support preconditioners (2004)"},{"key":"57_CR8","unstructured":"Miller, G., Vavasis, S.: Only large angles mater. Private communications (2005)"},{"key":"57_CR9","unstructured":"Pav, S.E.: Delaunay Refinement Algorithms. PhD thesis, Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania (2003)"},{"key":"57_CR10","unstructured":"Cheng, S.-W., Poon, S.-H.: Graded Conforming Delaunay Tetrahedralization with Bounded Radius-Edge Ratio. In: Proceedings of the Fourteenth Annual Symposium on Discrete Algorithms, Baltimore, Maryland. Society for Industrial and Applied Mathematics, pp. 295\u2013304 (2003)"},{"key":"57_CR11","unstructured":"Pav, S.E., Walkington, N.J.: Robust Three Dimensional Delaunay Refinement. In: Thirteenth International Meshing Roundtable, Williamsburg, Virginia, Sandia National Laboratories, pp. 145\u2013156(2004)"},{"key":"57_CR12","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Dey, T.K., Ramos, E.A., Ray, T.: Quality Meshing for Polyhedra with Small Angles. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, Brooklyn, New York. Association for Computing Machinery, pp. 290\u2013299 (2004)","DOI":"10.1145\/997817.997862"},{"key":"57_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/S0218195995000106","volume":"5","author":"M.W. Bern","year":"1995","unstructured":"Bern, M.W., Dobkin, D.P., Eppstein, D.: Triangulating polygons without large angles. Int. J. Comput. Geometry Appl.\u00a05, 171\u2013192 (1995)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"4","key":"57_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/BF02570715","volume":"14","author":"M.W. Bern","year":"1995","unstructured":"Bern, M.W., Mitchell, S.A., Ruppert, J.: Linear-size nonobtuse triangulation of polygons. Discrete & Computational Geometry\u00a014(4), 411\u2013428 (1995)","journal-title":"Discrete & Computational Geometry"},{"key":"57_CR15","first-page":"583","volume-title":"34th Annual Symposium on Foundations of Computer Science","author":"S.A. Mitchell","year":"1993","unstructured":"Mitchell, S.A.: Refining a triangulation of a planar straight-line graph to eliminate large angles. In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, pp. 583\u2013591. IEEE, Los Alamitos (1993)"},{"key":"57_CR16","doi-asserted-by":"crossref","unstructured":"Tan, T.S.: An optimal bound for high-quality conforming triangulations. GEOMETRY: Discrete and Computational Geometry\u00a015 (1996)","DOI":"10.1007\/BF02717730"},{"issue":"2","key":"57_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02187904","volume":"3","author":"B.S. Baker","year":"1988","unstructured":"Baker, B.S., Grosse, E., Rafferty, C.S.: Nonobtuse triangulation of polygons. Discrete Comput. Geom.\u00a03(2), 147\u2013168 (1988)","journal-title":"Discrete Comput. Geom."},{"key":"57_CR18","unstructured":"Dey, T.K.: Good triangulations in the plane. In: CCCG: Canadian Conference in Computational Geometry (1990)"},{"key":"57_CR19","unstructured":"Hudson, B., Miller, G., Phillips, T.: Sparse Voronoi Refinement, Technical Report CMU-CS-06-132, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania (2006)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:19Z","timestamp":1619518279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}