基于螺旋动态数据结构的动态凸包算法

2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI:10.1109/ICCSA.2007.72

Ali Sajedi Badashian, M. Razzazi

{"title":"基于螺旋动态数据结构的动态凸包算法","authors":"Ali Sajedi Badashian, M. Razzazi","doi":"10.1109/ICCSA.2007.72","DOIUrl":null,"url":null,"abstract":"In this paper we present an effective kinetic data structure (KDS) and algorithm for efficient maintenance of convex hull of moving points in 2d space. Given n objects continuously moving in the plane we present an efficient algorithm for maintaining their convex hull. Our algorithm considers cases based on status of a constant number of points. We show that our algorithm's time and space complexity are at most linear. A simulation program developed for testing the algorithm confirms the claim.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure\",\"authors\":\"Ali Sajedi Badashian, M. Razzazi\",\"doi\":\"10.1109/ICCSA.2007.72\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present an effective kinetic data structure (KDS) and algorithm for efficient maintenance of convex hull of moving points in 2d space. Given n objects continuously moving in the plane we present an efficient algorithm for maintaining their convex hull. Our algorithm considers cases based on status of a constant number of points. We show that our algorithm's time and space complexity are at most linear. A simulation program developed for testing the algorithm confirms the claim.\",\"PeriodicalId\":386960,\"journal\":{\"name\":\"2007 International Conference on Computational Science and its Applications (ICCSA 2007)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Science and its Applications (ICCSA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSA.2007.72\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSA.2007.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种有效的动态数据结构(KDS)和算法，用于二维空间中运动点的凸壳的有效维护。给定n个物体在平面上连续运动，我们提出了一种有效的算法来维持它们的凸包。我们的算法基于一个常量点的状态来考虑情况。我们证明了我们的算法的时间和空间复杂度最多是线性的。为测试该算法而开发的仿真程序证实了这一说法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure

In this paper we present an effective kinetic data structure (KDS) and algorithm for efficient maintenance of convex hull of moving points in 2d space. Given n objects continuously moving in the plane we present an efficient algorithm for maintaining their convex hull. Our algorithm considers cases based on status of a constant number of points. We show that our algorithm's time and space complexity are at most linear. A simulation program developed for testing the algorithm confirms the claim.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 International Conference on Computational Science and its Applications (ICCSA 2007)

自引率

0.00%

发文量