{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:33:44Z","timestamp":1758875624759,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2016YFB1101700"],"award-info":[{"award-number":["2016YFB1101700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2933551","type":"journal-article","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T01:53:07Z","timestamp":1565229187000},"page":"109094-109110","source":"Crossref","is-referenced-by-count":1,"title":["An Online Rapid Mesh Segmentation Method Based on an Online Sequential Extreme Learning Machine"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5747-7614","authenticated-orcid":false,"given":"Feiyu","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7469-8358","authenticated-orcid":false,"given":"Buyun","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8098-3857","authenticated-orcid":false,"given":"Xiyan","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xincheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuncheng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-4677-y"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2006.880583"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-016-1293-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900249"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.06.029"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2905618"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2017.06.007"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.02.100"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2005.12.126"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2883647"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12740"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2006.887183"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2835487"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2980179.2980238"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3072959.3073652"},{"key":"ref14","first-page":"652","article-title":"PointNet: Deep learning on point sets for 3D classification and segmentation","author":"qi","year":"2017","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00961"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-013-0824-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2016.02.015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2544311"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-018-1538-2"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s12220-010-9193-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531379"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CW.2015.31"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-018-01624-z"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778839"},{"key":"ref29","first-page":"135","article-title":"Optimizing 3D triangulations using discrete curvature analysis","volume":"1","author":"dyn","year":"2001","journal-title":"Math Methods for Curves and Surfaces"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54042-9_59"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01967.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.702"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2530691"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12434"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13323"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-017-1434-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-012-0749-1"},{"key":"ref21","article-title":"Spectral mesh segmentation via $\\ell0$ gradient minimization","author":"tong","year":"0","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-017-0594-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2018.03.004"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/PCCGA.2004.1348338","article-title":"Snaking across 3D meshes","author":"jung","year":"2004","journal-title":"Proc 12th Pacific Conf Comput Graph Appl (PG)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-017-1405-6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2757239"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2865169"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-005-0319-x"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08790697.pdf?arnumber=8790697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:32:43Z","timestamp":1641987163000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8790697\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2933551","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}