{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T01:16:48Z","timestamp":1773969408452,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete & Computational Geometry"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf02570715","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T04:22:00Z","timestamp":1177734120000},"page":"411-428","source":"Crossref","is-referenced-by-count":38,"title":["Linear-size nonobtuse triangulation of polygons"],"prefix":"10.1007","volume":"14","author":[{"given":"M.","family":"Bern","sequence":"first","affiliation":[]},{"given":"S.","family":"Michell","sequence":"additional","affiliation":[]},{"given":"J.","family":"Ruppert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1995,12,1]]},"reference":[{"key":"BF02570715_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1137\/0713021","volume":"13","author":"I. Babu\u015dka","year":"1976","unstructured":"I. Babu\u015dka and A. Aziz. On the angle condition in the finite element method.SIAM J. Numer. Anal. 13 (1976), 215\u2013227.","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02570715_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02187904","volume":"3","author":"B. S. Baker","year":"1988","unstructured":"B. S. Baker, E. Grosse, and C. S. Rafferty, Nonobtuse triangulation of polygons,Discrete Comput. Geom. 3 (1988), 147\u2013168.","journal-title":"Discrete Comput. Geom."},{"key":"BF02570715_CR3","unstructured":"R. E. Bank.PLTMG User's Guide. Philadelphia, PA, 1990."},{"key":"BF02570715_CR4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley and J. B. Saxe. Decomposable searching problems: 1. Static-to-dynamic transformation.J. Algorithms 1 (1980), 301\u2013358.","journal-title":"J. Algorithms"},{"key":"BF02570715_CR5","unstructured":"M. Bern, L. P. Chew, D. Eppstein, and J. Ruppert. Dihedral bounds for mesh generation in high dimensions.Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 189\u2013196."},{"key":"BF02570715_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1142\/S0218195995000106","volume":"5","author":"M. Bern","year":"1995","unstructured":"M. Bern, D. Dobkin, and D. Eppstein. Triangulating polygons without large angles.Proc. 8th Annual ACM Symp. on Computational Geometry, 1992, pp. 221\u2013231,Internat. J. Comput. Geom. Appl.,5 (1995), 171\u2013192.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"BF02570715_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1142\/S0218195992000159","volume":"2","author":"M. Bern","year":"1992","unstructured":"M. Bern and D. Eppstein. Polynomial-size nonobtuse triangulation of polygons,Internat. J. Comput. Geom. Appl. 2 (1992), 241\u2013255.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"BF02570715_CR8","series-title":"Tech. Report CSL-92-1","volume-title":"Mesh generation and optimal triangulation","author":"M. Bern","year":"1992","unstructured":"M. Bern and D. Eppstein, Mesh generation and optimal triangulation. Tech. Report CSL-92-1, Xerox PARC, Palo Alto, CA. Also inComputing in Euclidean Geometry, World Scientific, Singapore, 1992."},{"key":"BF02570715_CR9","doi-asserted-by":"crossref","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. Provably good mesh generation.Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990, pp. 231\u2013241,J. Comput. System Sci.,48 (1994), 384\u2013409.","journal-title":"J. Comput. System Sci."},{"key":"BF02570715_CR10","volume-title":"Introduction to Geometry","author":"H. S. M. Coxeter","year":"1961","unstructured":"H. S. M. Coxeter,Introduction to Geometry. Wiley, New York, 1961."},{"key":"BF02570715_CR11","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner and N. R. Shah. Incremental topological flipping works for regular triangulations.Proc. 8th Annual ACM Symp. on Computational Geometry, 1992, pp. 43\u201352.","DOI":"10.1145\/142675.142688"},{"key":"BF02570715_CR12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02573974","volume":"10","author":"H. Edelsbrunner","year":"1993","unstructured":"H. Edelsbrunner and T. S. Tan. An upper bound for conforming Delaunay triangulations.Discrete Comput. Geom. 10 (1993), 197\u2013213.","journal-title":"Discrete Comput. Geom."},{"key":"BF02570715_CR13","series-title":"Tech. Report 94-33","volume-title":"Faster circle packing with application to nonobtuse triangulation","author":"D. Eppstein","year":"1994","unstructured":"D. Eppstein, Faster circle packing with application to nonobtuse triangulation. Tech. Report 94-33. Department of Information and Computer Science, University of California, Irvine, CA, 1994. To appear inInternat. J. Comput. Geom. Appl."},{"key":"BF02570715_CR14","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"S. Fortune, A sweepline algorithm for Voronoi diagrams,Algorithmica 2 (1987), 153\u2013174.","journal-title":"Algorithmica"},{"key":"BF02570715_CR15","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01188708","volume":"9","author":"M. T. Goodrich","year":"1993","unstructured":"M. T. Goodrich, C. \u00d3D\u00falaing, and C. Yap, Computing the Voronoi diagram of a set of line segments in parallel.Algorithmica 9 (1993), 128\u2013141.","journal-title":"Algorithmica"},{"key":"BF02570715_CR16","unstructured":"MATLAB Reference Guide, The MathWorks, Inc., Natick, MA, 1992."},{"key":"BF02570715_CR17","doi-asserted-by":"crossref","unstructured":"E. Melissaratos and D. Souvaine, Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes.Proc. 8th Annual ACM Symp. on Computational Geometry, 1992, pp. 202\u2013211.","DOI":"10.1145\/142675.142719"},{"key":"BF02570715_CR18","doi-asserted-by":"crossref","unstructured":"S. A. Mitchell. Refining a triangulation of a planar straight-line graph to eliminate large anglesProc. 34th Symp. on Foundations of Computer Science, 1993, pp. 583\u2013591.","DOI":"10.1109\/SFCS.1993.366828"},{"key":"BF02570715_CR19","first-page":"55","volume":"16","author":"S. A. Mitchell","year":"1994","unstructured":"S. A. Mitchell. Finding a covering triangulation whose maximum angle is provably small. (Proc. 17th Annual Computer Science Conference).Austral. Comput. Sci. Comm. 16 (1994), 55\u201364.","journal-title":"Austral. Comput. Sci. Comm."},{"key":"BF02570715_CR20","doi-asserted-by":"crossref","unstructured":"J.-D. M\u00fcller. Proven angular bounds and stretched triangulations with the frontal Delaunay method.Proc. 11th AIAA Comp. Fluid Dynamics, Orlando, FL, 1993.","DOI":"10.2514\/6.1993-3347"},{"key":"BF02570715_CR21","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1109\/43.144849","volume":"10","author":"S. M\u00fcller","year":"1992","unstructured":"S. M\u00fcller, K. Kells, and W. Fichtner, Automatic rectangle-based adaptive mesh generation without obtuse angles,IEEE Trans. Computer-Aided Design 10 (1992), 855\u2013863.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"BF02570715_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry\u2014an Introduction","author":"F. Preparata","year":"1985","unstructured":"F. Preparata and M. Shamos,Computational Geometry\u2014an Introduction. Springer-Verlag, New York, 1985."},{"key":"BF02570715_CR23","first-page":"373","volume-title":"Calculus and Analytic Geometry","author":"J. F. Randolph","year":"1961","unstructured":"J. F. Randolph.Calculus and Analytic Geometry. Wadsworth, Belmont, CA, 1961, pp. 373\u2013374."},{"key":"BF02570715_CR24","unstructured":"J. Ruppert. A new and simple algorithm for quality two-dimensional mesh generation.Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 83\u201392."},{"key":"BF02570715_CR25","doi-asserted-by":"crossref","unstructured":"K. Shimada and D. C. Gossard. Computational methods for physically based FE mesh generation.Proc. IFIP TC5\/WG5.3 8th Internat. Conf. on PROLAMAT, Tokyo, 1992.","DOI":"10.1016\/B978-0-444-89465-6.50038-7"},{"key":"BF02570715_CR26","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"24","author":"D. D. Sleator","year":"1983","unstructured":"D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees,J. Comput. System Sci. 24 (1983), 362\u2013381.","journal-title":"J. Comput. System Sci."},{"key":"BF02570715_CR27","series-title":"Tech. Report 91-091-3-0058-6","volume-title":"Accurate circle configurations and numerical conformal mapping in polynomial time","author":"W. D. Smith","year":"1991","unstructured":"W. D. Smith. Accurate circle configurations and numerical conformal mapping in polynomial time. Tech. Report 91-091-3-0058-6, NEC Research Center, Princeton, NJ, 1991."},{"key":"BF02570715_CR28","volume-title":"An Analysis of the Finite Element Method","author":"G. Strang","year":"1973","unstructured":"G. Strang and G. J. Fix.An Analysis of the Finite Element Method, Prentice-Hall, Englewood Cliffs, NJ, 1973."},{"key":"BF02570715_CR29","doi-asserted-by":"crossref","unstructured":"T.-S. Tan. An optimal bound for conforming quality triangulations.Proc. 10th ACM Symp. on Computational Geometry, 1994, pp. 240\u2013249.","DOI":"10.1145\/177424.177976"},{"key":"BF02570715_CR30","series-title":"CMU-CS-91-184","volume-title":"Points, spheres, and separators: a unified geometric approach to graph partitioning","author":"S.-H. Teng","year":"1991","unstructured":"S.-H. Teng. Points, spheres, and separators: a unified geometric approach to graph partitioning. Ph.D. Thesis, CMU-CS-91-184, Carnegie Mellon University, Pittsburgh, PA, 1991."},{"key":"BF02570715_CR31","series-title":"Tech. Report TR93-1364","volume-title":"Stable finite elements for problems with wild coefficients","author":"S. A. Vavasis","year":"1993","unstructured":"S. A. Vavasis. Stable finite elements for problems with wild coefficients. Tech. Report TR93-1364, Department of Computer Science, Cornell University, Ithaca, NY, 1993."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02570715.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02570715\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02570715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T23:19:09Z","timestamp":1736983149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02570715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02570715"],"URL":"https:\/\/doi.org\/10.1007\/bf02570715","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}