{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:09Z","timestamp":1742913729257,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031479687"},{"type":"electronic","value":"9783031479694"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47969-4_27","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T20:02:06Z","timestamp":1701374526000},"page":"343-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SwarmCurves: Evolutionary Curve Reconstruction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0657-3796","authenticated-orcid":false,"given":"Alexander","family":"Komar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2336-4686","authenticated-orcid":false,"given":"Ursula","family":"Augsd\u00f6rfer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1007\/s00180-021-01077-4","volume":"36","author":"L Chen","year":"2021","unstructured":"Chen, L., Ghosh, S.K.: Uncertainty quantification and estimation of closed curves based on noisy data. Comput. Stat. 36, 2161\u20132176 (2021)","journal-title":"Comput. Stat."},{"key":"27_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23424-8","volume-title":"Variants of Evolutionary Algorithms for Real-World Applications","author":"R Chiong","year":"2011","unstructured":"Chiong, R., Weise, T., Michalewicz, Z.: Variants of Evolutionary Algorithms for Real-World Applications. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23424-8"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.laa.2015.01.010","volume":"471","author":"S Cipolla","year":"2015","unstructured":"Cipolla, S., Di Fiore, C., Tudisco, F., Zellini, P.: Adaptive matrix algebras in unconstrained minimization. Linear Algebra Appl. 471, 544\u2013568 (2015)","journal-title":"Linear Algebra Appl."},{"key":"27_CR4","unstructured":"De Boor, C., Rice, J.R.: Least squares cubic spline approximation i-fixed knots. International Mathematical and Statistical Libraries (1968)"},{"key":"27_CR5","unstructured":"De\u00a0Boor, C., Rice, J.R.: Least squares cubic spline approximation, ii-variable knots. International Mathematical and Statistical Libraries (1968)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1007\/s40995-017-0347-1","volume":"43","author":"A Ebrahimi","year":"2019","unstructured":"Ebrahimi, A., Loghmani, G.B.: B-spline curve fitting by diagonal approximation BFGS methods. Iran. J. Sci. Technol. Trans. A Sci. 43, 947\u2013958 (2019)","journal-title":"Iran. J. Sci. Technol. Trans. A Sci."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"113377","DOI":"10.1016\/j.eswa.2020.113377","volume":"152","author":"A Faramarzi","year":"2021","unstructured":"Faramarzi, A., Heidarinejad, M., Mirjalili, S., Gandomi, A.H.: Marine predators algorithm: a nature-inspired metaheuristic. Expert Syst. Appl. 152, 113377 (2021)","journal-title":"Expert Syst. Appl."},{"key":"27_CR8","volume-title":"Curves and Surfaces for CAGD","author":"G Farin","year":"2002","unstructured":"Farin, G.: Curves and Surfaces for CAGD. Morgan Kaufmann, San Fransisco (2002)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-69387-1_13","volume-title":"Computational Science \u2013 ICCS 2008","author":"A G\u00e1lvez","year":"2008","unstructured":"G\u00e1lvez, A., Cobo, A., Puig-Pey, J., Iglesias, A.: Particle swarm optimization for B\u00e9zier surface reconstruction. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008. LNCS, vol. 5102, pp. 116\u2013125. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69387-1_13"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-540-74477-1_62","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"A G\u00e1lvez","year":"2007","unstructured":"G\u00e1lvez, A., Iglesias, A., Cobo, A., Puig-Pey, J., Espinola, J.: B\u00e9zier curve and surface fitting of 3D point clouds through genetic algorithms, functional networks and least-squares approximation. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007. LNCS, vol. 4706, pp. 680\u2013693. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74477-1_62"},{"issue":"12","key":"27_CR11","doi-asserted-by":"publisher","first-page":"4831","DOI":"10.1016\/j.cnsns.2012.05.010","volume":"17","author":"AH Gandomi","year":"2012","unstructured":"Gandomi, A.H., Alavi, A.H.: Krill herd: a new bio-inspired optimization algorithm. Commun. Nonlinear Sci. Numer. Simul. 17(12), 4831\u20134845 (2012)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"100868","DOI":"10.1016\/j.swevo.2021.100868","volume":"63","author":"EH Houssein","year":"2021","unstructured":"Houssein, E.H., Gad, A.G., Hussain, K., Suganthan, P.N.: Major advances in particle swarm optimization: theory, analysis, and application. Swarm Evol. Comput. 63, 100868 (2021)","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.3233\/ICA-170550","volume":"24","author":"A Iglesias","year":"2017","unstructured":"Iglesias, A., G\u00e1lvez, A., Collantes, M.: Multilayer embedded bat algorithm for B-spline curve reconstruction. Integr. Comput.-Aided Eng. 24(4), 385\u2013399 (2017)","journal-title":"Integr. Comput.-Aided Eng."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.istruc.2020.03.033","volume":"25","author":"A Kaveh","year":"2020","unstructured":"Kaveh, A., Dadras Eslamlou, A.: Water strider algorithm: a new metaheuristic and applications. Structures 25, 520\u2013541 (2020)","journal-title":"Structures"},{"issue":"28","key":"27_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.17485\/ijst\/2016\/v9i28\/84138","volume":"9","author":"K Kavita","year":"2016","unstructured":"Kavita, K., Navin, R., Madan, A.S.: Piecewise feature extraction and artificial neural networks: an approach towards curve reconstruction. Indian J. Sci. Technol. 9(28), 121\u2013134 (2016)","journal-title":"Indian J. Sci. Technol."},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"2","key":"27_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-8396(99)00044-8","volume":"17","author":"IK Lee","year":"2000","unstructured":"Lee, I.K.: Curve reconstruction from unorganized points. Comput. Aided Geom. Des. 17(2), 161\u2013177 (2000)","journal-title":"Comput. Aided Geom. Des."},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/s00371-005-0304-4","volume":"21","author":"H Lin","year":"2005","unstructured":"Lin, H., Chen, W., Wang, G.: Curve reconstruction based on an interval B-spline curve. Vis. Comput. 21, 418\u2013427 (2005)","journal-title":"Vis. Comput."},{"key":"27_CR19","unstructured":"Liu, Y., D\u2019Aronco, S., Schindler, K., Wegner, J.D.: PC2WF: 3D wireframe reconstruction from raw point clouds. arXiv preprint arXiv:2103.02766 (2021)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Matveev, A., et al.: DEF: Deep estimation of sharp geometric features in 3D shapes. ACM Trans. Graph. 41(4) (2022)","DOI":"10.1145\/3528223.3530140"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51\u201367 (2016)","journal-title":"Adv. Eng. Softw."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Ohrhallinger, S., Peethambaran, J., Parakkat, A.D., Dey, T.K., Muthuganapathy, R.: 2D points curve reconstruction survey and benchmark. In: Computer Graphics Forum, vol. 40, pp. 611\u2013632. Wiley Online Library (2021)","DOI":"10.1111\/cgf.142659"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Ostertagov\u00e1, E.: Modelling using polynomial regression. Procedia Eng. 48, 500\u2013506 (2012). Modelling of Mechanical and Mechatronics Systems","DOI":"10.1016\/j.proeng.2012.09.545"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Park, H., Lee, J.: B-spline curve fitting based on adaptive curve refinement using dominant points. Comput. Aided Des. 39, 439\u2013451 (2007)","DOI":"10.1016\/j.cad.2006.12.006"},{"key":"27_CR25","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.cagd.2004.03.003","volume":"21","author":"H Park","year":"2004","unstructured":"Park, H.: An error-bounded approximate method for representing planar curves in B-splines. Comput. Aided Geom. Des. 21, 479\u2013497 (2004)","journal-title":"Comput. Aided Geom. Des."},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Shami, T.M., El-Saleh, A.A., Alswaitti, M., Al-Tashi, Q., Summakieh, M.A., Mirjalili, S.: Particle swarm optimization: a comprehensive survey. IEEE Access 10, 10031\u201310061 (2022)","DOI":"10.1109\/ACCESS.2022.3142859"},{"key":"27_CR27","doi-asserted-by":"publisher","first-page":"106960","DOI":"10.1016\/j.asoc.2020.106960","volume":"100","author":"B Song","year":"2021","unstructured":"Song, B., Wang, Z., Zou, L.: An improved PSO algorithm for smooth path planning of mobile robots using continuous high-degree Bezier curve. Appl. Soft Comput. 100, 106960 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"19","key":"27_CR28","doi-asserted-by":"publisher","first-page":"9465","DOI":"10.3390\/app12199465","volume":"12","author":"C Sun","year":"2022","unstructured":"Sun, C., Liu, M., Ge, S.: B-spline curve fitting of hungry predation optimization on ship line design. Appl. Sci. 12(19), 9465 (2022)","journal-title":"Appl. Sci."},{"issue":"4","key":"27_CR29","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0010-4485(96)00054-1","volume":"29","author":"T Varady","year":"1997","unstructured":"Varady, T., Martin, R., Cox, J.: Reverse engineering of geometric models - an introduction. Comput. Aided Des. 29(4), 255\u2013268 (1997)","journal-title":"Comput. Aided Des."},{"key":"27_CR30","unstructured":"Wang, X., et al.: PIE-NET: parametric inference of point cloud edges. In: Advances in Neural Information Processing Systems, vol. 33, pp. 20167\u201320178. Curran Associates, Inc. (2020)"},{"issue":"1","key":"27_CR31","first-page":"24","volume":"3","author":"M Yazdani","year":"2015","unstructured":"Yazdani, M., Jolai, F.: Lion optimization algorithm (LOA): a nature-inspired metaheuristic algorithm. J. Comput. Des. Eng. 3(1), 24\u201336 (2015)","journal-title":"J. Comput. Des. Eng."},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Ye, Y., Yi, R., Gao, Z., Zhu, C., Cai, Z., Xu, K.: NEF: neural edge fields for 3D parametric curve reconstruction from multi-view images (2023)","DOI":"10.1109\/CVPR52729.2023.00820"},{"issue":"15","key":"27_CR33","doi-asserted-by":"publisher","first-page":"11543","DOI":"10.1007\/s00521-019-04641-8","volume":"32","author":"S Yilmaz","year":"2020","unstructured":"Yilmaz, S., Sen, S.: Electric fish optimization: a new heuristic algorithm inspired by electrolocation. Neural Comput. Appl. 32(15), 11543\u201311578 (2020)","journal-title":"Neural Comput. Appl."}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47969-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T14:59:46Z","timestamp":1730732386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47969-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031479687","9783031479694"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47969-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISVC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Visual Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lake Tahoe, NV","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isvc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.isvc.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"232% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43 (oral), 15 (poster), 25 (special tracks) out of 34 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}