{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T13:00:24Z","timestamp":1700312424409},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0010-4485(00)00125-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:45:13Z","timestamp":1027626313000},"page":"263-277","source":"Crossref","is-referenced-by-count":29,"title":["Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problem"],"prefix":"10.1016","volume":"33","author":[{"given":"M.-C.","family":"Rivara","sequence":"first","affiliation":[]},{"given":"N.","family":"Hitschfeld","sequence":"additional","affiliation":[]},{"given":"B.","family":"Simpson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0010-4485(00)00125-1_BIB1","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1002\/nme.1620200412","article-title":"Algorithms for refining triangular grids stuitable for adative and multigrid techniques","volume":"20","author":"Rivara","year":"1984","journal-title":"International Journal for Numerical Methods in Engineering"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB2","doi-asserted-by":"crossref","first-page":"2889","DOI":"10.1002\/nme.1620281212","article-title":"Selective refinement\/derefinement algorithms for sequences of nested triangulations","volume":"28","author":"Rivara","year":"1989","journal-title":"International Journal for Numerical Methods in Engineering"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/cnm.1630080502","article-title":"Refinement Algorithm for adaptive and multigrid Techniques","volume":"8","author":"Rivara","year":"1992","journal-title":"Communications in Applied Numerical Methods"},{"issue":"216","key":"10.1016\/S0010-4485(00)00125-1_BIB4","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1090\/S0025-5718-96-00772-7","article-title":"The 4-triangles longest-side partition of triangles and linear refinement algorithms","volume":"65","author":"Rivara","year":"1996","journal-title":"Mathematics of Computtion"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BF01198736","article-title":"Cost analysis of the longest-side (triangle bisection) refinement algorithms for triangulations","volume":"12","author":"Rivara","year":"1996","journal-title":"Engineering with Computers"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02187904","article-title":"Non-obtuse triangulation of polygons","volume":"3","author":"Baker","year":"1988","journal-title":"Journal of Discoveries in Computational Geometry"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB7","series-title":"Mesh generation and optimal triangulation","author":"Bern","year":"1992"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB8","doi-asserted-by":"crossref","unstructured":"Bern M, Epstein D, Gilbert J. Provably good mesh generation. Proceedings of the 31st Annual Symposium on Foundations of Computer Science. New York: IEEE, 1990. p. 384\u201309.","DOI":"10.1109\/FSCS.1990.89542"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB9","doi-asserted-by":"crossref","unstructured":"Melissaratos E, Souvaine D. Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes. Proceedings of the Eight Annual Symposium on Computational Geometry. New York: ACM, 1992. p. 202\u201311.","DOI":"10.1145\/142675.142719"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB10","doi-asserted-by":"crossref","unstructured":"Mitchell S, Vavasis S. Quality mesh generation in three dimensions. Proceedings of the Eighth Annual Symposium on Computational Geometty. New York: ACM (Full version on Cornell Technical Report TR 92-1267), 1992. p. 212\u201321.","DOI":"10.1145\/142675.142720"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB11","doi-asserted-by":"crossref","unstructured":"Hitschfeld N. Generalization of modified octrees for geometric modeling. Geometric modeling: theory and practice, the state of the art. Berlin: Springer, 1997. p. 260\u201372.","DOI":"10.1007\/978-3-642-60607-6_17"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","article-title":"Constrained delaunay triangulation","volume":"4","author":"Chew","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB13","doi-asserted-by":"crossref","unstructured":"Chew L. Guaranteed-quality triangular meshes. Technical Report TR-89-983, Cornell University, 1989.","DOI":"10.21236\/ADA210101"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB14","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1006\/jagm.1995.1021","article-title":"A delaunay refinement algorithm for quality 2-d mesh generation","volume":"18","author":"Ruppert","year":"1995","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB15","doi-asserted-by":"crossref","unstructured":"Shewchk JR. Tetrahedral mesh generation by Delaunay refinement. Proceedings of the14th Annual ACM Symposium on Computational Geometry, 1998. p. 86\u201395.","DOI":"10.1145\/276884.276894"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB16","unstructured":"Rivara MC. New mathematical tools and techniques for the refinement and\/or improvement of unstructured triangulations. Proceedings of the Fifth International Meshing Roundtable. Pittsburgh, 1996. p. 77\u201386."},{"key":"10.1016\/S0010-4485(00)00125-1_BIB17","doi-asserted-by":"crossref","first-page":"3313","DOI":"10.1002\/(SICI)1097-0207(19970930)40:18<3313::AID-NME214>3.0.CO;2-#","article-title":"New longest-edge algorithms for the refinement and\/or improvement of unstructured triangulations","volume":"40","author":"Rivara","year":"1997","journal-title":"International Journal of Numerical Methods"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB18","unstructured":"Rivara MC, Inostroza P. A discussion on mixed (longest side midpoint insertion) Delaunay techniques for the triangulation refinement problem. Proceedings of the Fourth International Meshing Roundtable. Albuquerque, 1995. p. 335\u2013346."},{"key":"10.1016\/S0010-4485(00)00125-1_BIB19","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1002\/(SICI)1097-0207(19970228)40:4<581::AID-NME45>3.0.CO;2-K","article-title":"Using longest-side bisection techniques for the automatic refinement of Delaunay triangulations","volume":"40","author":"Rivara","year":"1997","journal-title":"International Journal for Numerical Methods in Engineering"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB20","first-page":"1","article-title":"New Lepp algorithms for quality polygon and volume triangulation: implementation issues and practical benhavior","volume":"AMD vol. 220","author":"Rivara","year":"1997"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB21","unstructured":"Rivara MC, Hitschfeld N. Lepp\u2013Delaunay algorithm: a robust tool for producing size-optimal quality triangulations. Proceedings of the Eighth International Meshing Roundtable, October 1999. p. 205\u201320."},{"key":"10.1016\/S0010-4485(00)00125-1_BIB22","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0141-1195(87)90043-X","article-title":"A fast algorithm for constructing delaunay triangulations in the plane","volume":"9","author":"Sloan","year":"1987","journal-title":"Advances in Engineering Software"},{"key":"10.1016\/S0010-4485(00)00125-1_BIB23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/21.3.243","article-title":"Locally equiangular triangulations","volume":"21","author":"Sibson","year":"1978","journal-title":"The Computer Journal"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448500001251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448500001251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T07:56:13Z","timestamp":1555919773000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0010448500001251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0010448500001251"],"URL":"https:\/\/doi.org\/10.1016\/s0010-4485(00)00125-1","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}