目击者和收集者平滑了凸壳的复杂性

Q4 Mathematics

International Journal of Computational Geometry & Applications Pub Date : 2016-02-22 DOI:10.20382/jocg.v7i2a6

O. Devillers, M. Glisse, X. Goaoc, Rémy Thomasse

{"title":"目击者和收集者平滑了凸壳的复杂性","authors":"O. Devillers, M. Glisse, X. Goaoc, Rémy Thomasse","doi":"10.20382/jocg.v7i2a6","DOIUrl":null,"url":null,"abstract":"We present a simple technique for analyzing the size of geometric hypergraphs defined by random point sets. As an application we obtain upper and lower bounds on the smoothed number of faces of the convex hull under Euclidean and Gaussian noise and related results.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"66 1","pages":"101-144"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Smoothed complexity of convex hulls by witnesses and collectors\",\"authors\":\"O. Devillers, M. Glisse, X. Goaoc, Rémy Thomasse\",\"doi\":\"10.20382/jocg.v7i2a6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a simple technique for analyzing the size of geometric hypergraphs defined by random point sets. As an application we obtain upper and lower bounds on the smoothed number of faces of the convex hull under Euclidean and Gaussian noise and related results.\",\"PeriodicalId\":54969,\"journal\":{\"name\":\"International Journal of Computational Geometry & Applications\",\"volume\":\"66 1\",\"pages\":\"101-144\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20382/jocg.v7i2a6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20382/jocg.v7i2a6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 12

摘要

我们提出了一种简单的技术来分析由随机点集定义的几何超图的大小。作为一个应用，我们得到了在欧几里得和高斯噪声下凸壳光滑面数的上界和下界以及相关结果。

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

查看原文本刊更多论文

Smoothed complexity of convex hulls by witnesses and collectors

We present a simple technique for analyzing the size of geometric hypergraphs defined by random point sets. As an application we obtain upper and lower bounds on the smoothed number of faces of the convex hull under Euclidean and Gaussian noise and related results.

求助全文

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

来源期刊

International Journal of Computational Geometry & Applications 数学-计算机：理论方法

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms. Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.