接近线性大小的Voronoi图的替代

Proceedings 2001 IEEE International Conference on Cluster Computing Pub Date : 2001-10-14 DOI:10.1109/SFCS.2001.959884

Sariel Har-Peled

{"title":"接近线性大小的Voronoi图的替代","authors":"Sariel Har-Peled","doi":"10.1109/SFCS.2001.959884","DOIUrl":null,"url":null,"abstract":"For a set P of n points in R/sup d/, we define a new type of space decomposition. The new diagram provides an /spl epsi/-approximation to the distance function associated with the Voronoi diagram of P, while being of near linear size, for d/spl ges/2. This contrasts with the standard Voronoi diagram that has /spl Omega/ (n/sup [d/2]/) complexity in the worst case.","PeriodicalId":378126,"journal":{"name":"Proceedings 2001 IEEE International Conference on Cluster Computing","volume":"70 9-10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"178","resultStr":"{\"title\":\"A replacement for Voronoi diagrams of near linear size\",\"authors\":\"Sariel Har-Peled\",\"doi\":\"10.1109/SFCS.2001.959884\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a set P of n points in R/sup d/, we define a new type of space decomposition. The new diagram provides an /spl epsi/-approximation to the distance function associated with the Voronoi diagram of P, while being of near linear size, for d/spl ges/2. This contrasts with the standard Voronoi diagram that has /spl Omega/ (n/sup [d/2]/) complexity in the worst case.\",\"PeriodicalId\":378126,\"journal\":{\"name\":\"Proceedings 2001 IEEE International Conference on Cluster Computing\",\"volume\":\"70 9-10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"178\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE International Conference on Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.2001.959884\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 IEEE International Conference on Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.2001.959884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 178

摘要

对于R/sup /中n个点的集合P，我们定义了一种新的空间分解类型。新的图提供了与P的Voronoi图相关的距离函数的/spl epsi/-近似值，同时具有接近线性的大小，用于d/spl ges/2。这与在最坏情况下具有/spl Omega/ (n/sup [d/2]/)复杂性的标准Voronoi图形成对比。

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

查看原文本刊更多论文

A replacement for Voronoi diagrams of near linear size

For a set P of n points in R/sup d/, we define a new type of space decomposition. The new diagram provides an /spl epsi/-approximation to the distance function associated with the Voronoi diagram of P, while being of near linear size, for d/spl ges/2. This contrasts with the standard Voronoi diagram that has /spl Omega/ (n/sup [d/2]/) complexity in the worst case.

求助全文

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

来源期刊

Proceedings 2001 IEEE International Conference on Cluster Computing

自引率

0.00%

发文量