一种最优凸包算法及其在岩屑上的新结果

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI:10.1109/SFCS.1991.185345

B. Chazelle

{"title":"一种最优凸包算法及其在岩屑上的新结果","authors":"B. Chazelle","doi":"10.1109/SFCS.1991.185345","DOIUrl":null,"url":null,"abstract":"An optimal algorithm for computing hyperplane cuttings is given. It results in a new kind of cutting, which enjoys all the properties of the previous ones and, in addition, can be refined by composition. An optimal algorithm for computing the convex hull of a finite point set in any fixed dimension is also given.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"75","resultStr":"{\"title\":\"An optimal convex hull algorithm and new results on cuttings\",\"authors\":\"B. Chazelle\",\"doi\":\"10.1109/SFCS.1991.185345\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimal algorithm for computing hyperplane cuttings is given. It results in a new kind of cutting, which enjoys all the properties of the previous ones and, in addition, can be refined by composition. An optimal algorithm for computing the convex hull of a finite point set in any fixed dimension is also given.<<ETX>>\",\"PeriodicalId\":320781,\"journal\":{\"name\":\"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"75\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1991.185345\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1991.185345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 75

摘要

给出了一种计算超平面切屑的最优算法。它产生了一种新的切削方法，它不仅具有以前切削方法的所有性能，而且还可以通过成分加以改进。给出了计算任意定维有限点集凸壳的最优算法。

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

查看原文本刊更多论文

An optimal convex hull algorithm and new results on cuttings

An optimal algorithm for computing hyperplane cuttings is given. It results in a new kind of cutting, which enjoys all the properties of the previous ones and, in addition, can be refined by composition. An optimal algorithm for computing the convex hull of a finite point set in any fixed dimension is also given.<>

求助全文

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

来源期刊

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science

自引率

0.00%

发文量