{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:33:58Z","timestamp":1649000038889},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Comput. Sci. & Technol."],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1007\/bf02943508","type":"journal-article","created":{"date-parts":[[2008,9,4]],"date-time":"2008-09-04T12:25:10Z","timestamp":1220531110000},"page":"491-508","source":"Crossref","is-referenced-by-count":1,"title":["A new approach to fully automatic mesh generation"],"prefix":"10.1007","volume":"10","author":[{"given":"Weidong","family":"Min","sequence":"first","affiliation":[]},{"given":"Zesheng","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Zhengming","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Minzhi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"BF02943508_CR1","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1002\/nme.1620170706","volume":"17","author":"R Haber","year":"1981","unstructured":"Haber Ret al. A general two-dimensional, graphical finite element preprocessor utilizing discrete transfinite mappings.Int\u2019l J. Numer. Methods Eng., 1981, 17(7): 1015\u20131044.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"1","key":"BF02943508_CR2","first-page":"39","volume":"3","author":"M A Yerry","year":"1983","unstructured":"Yerry M A, Shephard M S. A modified quadtree approach to finite element mesh generation.IEEE CG&A, 1983, 3(1): 39\u201346.","journal-title":"IEEE CG&A"},{"issue":"6","key":"BF02943508_CR3","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1002\/nme.1620240603","volume":"24","author":"P L Baehmann","year":"1987","unstructured":"Baehmann P Let al. Robust, geometrically based, automatic two-dimensional mesh generation.Int\u2019l J. Numer. Methods Eng., 1987, 24(6): 1043\u20131078.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"12","key":"BF02943508_CR4","doi-asserted-by":"crossref","first-page":"1813","DOI":"10.1002\/nme.1620151206","volume":"15","author":"E A Sadek","year":"1980","unstructured":"Sadek E A. A scheme for the automatic generation of triangular finite elements.Int\u2019l J. Numer Methods Eng., 1980, 15(12): 1813\u20131822.","journal-title":"Int\u2019l J. Numer Methods Eng."},{"issue":"6","key":"BF02943508_CR5","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1002\/nme.1620290613","volume":"29","author":"K Deljouie-Rakhshandeh","year":"1990","unstructured":"Deljouie-Rakhshandeh K. An approach to the generation of triangular grids possessing few obtuse triangles.Int.l J. Numer. Methods Eng., 1990, 29(6): 1299\u20131321.","journal-title":"Int.l J. Numer. Methods Eng."},{"issue":"7","key":"BF02943508_CR6","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1002\/nme.1620290709","volume":"29","author":"H Jin","year":"1990","unstructured":"Jin H, Wiberg N. Two-dimensional mesh generation, adaptive remeshing and refinement.Int\u2019l J. Numer. Methods Eng., 1990, 29(7): 1501\u20131526.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"4","key":"BF02943508_CR7","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1002\/nme.1620320411","volume":"32","author":"J Z Zhu","year":"1991","unstructured":"Zhu J Zet al. A new approach to the development of automatic quadrilateral mesh generation.Int.\u2019l J. Numer. Methods Eng., 1991, 32(4): 849\u2013866.","journal-title":"Int.\u2019l J. Numer. Methods Eng."},{"issue":"1","key":"BF02943508_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/nme.1620120110","volume":"12","author":"R D Shaw","year":"1978","unstructured":"Shaw R D, Pitchen R G. Modifications to the Suhara-Fukuda method of network generation.Int\u2019l J. Numer. Methods Eng., 1978, 12(1): 93\u201399.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"4","key":"BF02943508_CR9","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1002\/nme.1620080402","volume":"8","author":"J C Cavendish","year":"1974","unstructured":"Cavendish J C. Automatic triangulation of arbitrary planar domains for the finite element method.Int\u2019l J. Numer. Methods Eng., 1974, 8(4): 679\u2013696.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"6","key":"BF02943508_CR10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/0167-8396(91)90028-A","volume":"8","author":"N Sapidis","year":"1991","unstructured":"Sapidis N, Perucchio R. Delaunay triangulation of arbitrarily shaped planar domains.Computer Aided Geometric Design, 1991, 8(6): 421\u2013437.","journal-title":"Computer Aided Geometric Design"},{"issue":"2","key":"BF02943508_CR11","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0907035","volume":"7","author":"B Joe","year":"1986","unstructured":"Joe B. Delaunay triangular meshes in convex polygons.SIAM J Scientific and Statistical Computing, 1986, 7(2): 514\u2013539.","journal-title":"SIAM J Scientific and Statistical Computing"},{"issue":"2","key":"BF02943508_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0045-7949(90)90131-K","volume":"36","author":"R P Bhatia","year":"1990","unstructured":"Bhatia R P, Lawrence K L. Two-dimensional finite element mesh generation based on stripwise automatic triangulation.Computers & Structures, 1990, 36(2): 309\u2013319.","journal-title":"Computers & Structures"},{"issue":"4","key":"BF02943508_CR13","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1002\/nme.1620320410","volume":"32","author":"T D Blacker","year":"1991","unstructured":"Blacker T D, Stephenson M B. Paving: A new approach to automated quadrilateral mesh generation.Int\u2019l J. Numer. Methods Eng., 1991, 32(4): 811\u2013847.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"5","key":"BF02943508_CR14","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1002\/nme.1620230503","volume":"23","author":"B Joe","year":"1986","unstructured":"Joe B, Simpson R B. Triangular meshes for regions of complicated shape.Int\u2019l J. Numer. Methods Eng., 1986, 23(5): 751\u2013778.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"7","key":"BF02943508_CR15","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1002\/nme.1620320705","volume":"32","author":"L Sezer","year":"1991","unstructured":"Sezer L, Zeid I. Automatic quadrilateral\/triangular free-form mesh generation for planar regions.Int\u2019l J. Numer. Methods Eng., 1991, 32(7): 1441\u20131483.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"7","key":"BF02943508_CR16","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1002\/nme.1620290712","volume":"29","author":"J A Talbert","year":"1990","unstructured":"Talbert J A, Parkinson A R. Development of an automatic, two-dimensional finite element mesh generator using quadrilateral elements and bezier curve boundary definition.Int\u2019l J. Numer. Methods Eng., 1990, 29(7): 1551\u20131567.","journal-title":"Int\u2019l J. Numer. Methods Eng."},{"issue":"4","key":"BF02943508_CR17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0168-874X(91)90004-I","volume":"9","author":"V N Parthasarathy","year":"1991","unstructured":"Parthasarathy V N, Kodiyalam S. A constrained optimization approach to finite element mesh smoothing.Finite Elements in Analysis and Design, 1991, 9(4): 309\u2013320.","journal-title":"Finite Elements in Analysis and Design"},{"issue":"3","key":"BF02943508_CR18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"D T Lee","year":"1980","unstructured":"Lee D T, Schachter B J. Two algorithms for constructing a Delaunay triangulation.Int. J. Computer and Information Sciences, 1980, 9(3): 219\u2013242.","journal-title":"Int. J. Computer and Information Sciences"},{"issue":"6","key":"BF02943508_CR19","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1002\/nme.1620100612","volume":"10","author":"B Bykat","year":"1976","unstructured":"Bykat B. Automatic generation of triangular grid: I\u2014subdivision of a general polygon into convex subregions. II\u2014triangulation of convex polygons.Int\u2019l J. Numer. Methods Eng., 1976, 10(6): 1329\u20131342.","journal-title":"Int\u2019l J. Numer. Methods Eng."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02943508.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02943508\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02943508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:16:20Z","timestamp":1558455380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02943508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["BF02943508"],"URL":"https:\/\/doi.org\/10.1007\/bf02943508","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}