Sina Algorithm: Proposing a Distributed Agent-driven Algorithm For Solving Convex Hull Problem

Sina Algorithm: Proposing a Distributed Agent-driven Algorithm For Solving Convex Hull Problem | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Sina Algorithm: Proposing a Distributed Agent-driven Algorithm For Solving Convex Hull Problem Sina Saadati, Mohammadreza Razzazi This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7160843/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Natural computing is a multidisciplinary field at the intersection of computer science and nature, focusing on how natural processes can be mimicked, learned from, or harnessed to solve computational problems. This research addresses the convex hull problem—a well-known task in computational geometry that involves determining the minimal convex polygon enclosing a given set of points in a plane—by exploring nature-inspired solutions. We first present an agent-driven simulation that replicates the natural mechanism for solving the convex hull problem. Subsequently, we optimize the simulation computationally to develop a fast algorithm that achieves a worst-case time complexity of \(\:\:O\left(n\text{log}n\right)\) , which is optimal for this problem. Finally, we introduce a distributed computing approach to implement the proposed algorithm, achieving an average execution time complexity of \(\:Avg\left(\frac{n\:log\:n}{m}\right)\) , where n denotes the problem size and m the number of computational nodes utilized. Software Engineering Agent-based Modeling and Simulation Convex Hull Problem Computational Geometry Agent-driven Algorithms Natural Computing Full Text Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7160843","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":487649481,"identity":"f9e2673a-2ffb-4014-b83a-2fa1e2a713b5","order_by":0,"name":"Sina Saadati","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA8ElEQVRIiWNgGAWjYDACZhjjABB9gHESiNPCzHBwBgODBGEtcADUwswD04IPyLfzHvzA8MdOnu/4+YOHbWoO1zGwH37A8HAPbi0Gh/mSJRjbkg1nnklmOJxz7LAEA0+aAUPCMzxamHkMJBgbmBk3HABpYQNqYcgB+uUAHoc18xj/YPhTb7/h/GOGwxb/gFr43+DXwnCYx0yCge1w4oYbQFsY24BaJAjYYgDUYpHYdjx55o3HBgd7+9Il2ySeGRzA67D+M8Y3Pvyptu07n/j4w49v1vz8/MkPH/7A5zAQSEDmsDGAU8IoGAWjYBSMAkoAAAtYUPCje5C1AAAAAElFTkSuQmCC","orcid":"","institution":"Department of Computer Engineering, Amirkabir University of Technology(Tehran Polytechnic), Tehran, Iran.","correspondingAuthor":true,"prefix":"","firstName":"Sina","middleName":"","lastName":"Saadati","suffix":""},{"id":487649482,"identity":"022712a2-e4a6-46f6-833f-a1bfe099ebf2","order_by":1,"name":"Mohammadreza Razzazi","email":"","orcid":"","institution":"Amirkabir University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Mohammadreza","middleName":"","lastName":"Razzazi","suffix":""}],"badges":[],"createdAt":"2025-07-18 22:48:47","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-7160843/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7160843/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":87467145,"identity":"2bf1cf05-9025-498d-855f-e1094bc3b777","added_by":"auto","created_at":"2025-07-24 08:01:07","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":522093,"visible":true,"origin":"","legend":"","description":"","filename":"ABMS.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7160843/v1_covered_d363ec85-2c47-489f-8a63-e49cdcd4a8a4.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eSina Algorithm: Proposing a Distributed Agent-driven Algorithm For Solving Convex Hull Problem\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"Amirkabir University of Technology","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Agent-based Modeling and Simulation, Convex Hull Problem, Computational Geometry, Agent-driven Algorithms, Natural Computing","lastPublishedDoi":"10.21203/rs.3.rs-7160843/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7160843/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eNatural computing is a multidisciplinary field at the intersection of computer science and nature, focusing on how natural processes can be mimicked, learned from, or harnessed to solve computational problems. This research addresses the convex hull problem\u0026mdash;a well-known task in computational geometry that involves determining the minimal convex polygon enclosing a given set of points in a plane\u0026mdash;by exploring nature-inspired solutions. We first present an agent-driven simulation that replicates the natural mechanism for solving the convex hull problem. Subsequently, we optimize the simulation computationally to develop a fast algorithm that achieves a worst-case time complexity of\u003cspan class=\"InlineEquation\"\u003e\u003cspan class=\"mathinline\"\u003e\\(\\:\\:O\\left(n\\text{log}n\\right)\\)\u003c/span\u003e\u003c/span\u003e, which is optimal for this problem. Finally, we introduce a distributed computing approach to implement the proposed algorithm, achieving an average execution time complexity of \u003cspan class=\"InlineEquation\"\u003e\u003cspan class=\"mathinline\"\u003e\\(\\:Avg\\left(\\frac{n\\:log\\:n}{m}\\right)\\)\u003c/span\u003e\u003c/span\u003e, where n denotes the problem size and m the number of computational nodes utilized.\u003c/p\u003e","manuscriptTitle":"Sina Algorithm: Proposing a Distributed Agent-driven Algorithm For Solving Convex Hull Problem","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-23 05:04:55","doi":"10.21203/rs.3.rs-7160843/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"8ead6eda-6442-4421-a8de-a0797042caea","owner":[],"postedDate":"July 23rd, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":51775717,"name":"Software Engineering"}],"tags":[],"updatedAt":"2025-07-23T05:04:55+00:00","versionOfRecord":[],"versionCreatedAt":"2025-07-23 05:04:55","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7160843","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7160843","identity":"rs-7160843","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}