高阶Voronoi图的扫线算法

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI:10.1109/ISVD.2013.17

Maksym Zavershynskyi, Evanthia Papadopoulou

{"title":"高阶Voronoi图的扫线算法","authors":"Maksym Zavershynskyi, Evanthia Papadopoulou","doi":"10.1109/ISVD.2013.17","DOIUrl":null,"url":null,"abstract":"We present an algorithm to construct order-k Voronoi diagrams with a sweepline technique. The sites can be points or line segments. The algorithm has O(nk2 log n) time complexity and O(nk) space complexity.","PeriodicalId":344701,"journal":{"name":"2013 10th International Symposium on Voronoi Diagrams in Science and Engineering","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A Sweepline Algorithm for Higher Order Voronoi Diagrams\",\"authors\":\"Maksym Zavershynskyi, Evanthia Papadopoulou\",\"doi\":\"10.1109/ISVD.2013.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an algorithm to construct order-k Voronoi diagrams with a sweepline technique. The sites can be points or line segments. The algorithm has O(nk2 log n) time complexity and O(nk) space complexity.\",\"PeriodicalId\":344701,\"journal\":{\"name\":\"2013 10th International Symposium on Voronoi Diagrams in Science and Engineering\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th International Symposium on Voronoi Diagrams in Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVD.2013.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International Symposium on Voronoi Diagrams in Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.2013.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

我们提出了一种用扫线技术构造k阶Voronoi图的算法。这些位置可以是点或线段。该算法的时间复杂度为O(nk2 log n)，空间复杂度为O(nk)。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Sweepline Algorithm for Higher Order Voronoi Diagrams

We present an algorithm to construct order-k Voronoi diagrams with a sweepline technique. The sites can be points or line segments. The algorithm has O(nk2 log n) time complexity and O(nk) space complexity.

求助全文

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

来源期刊

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering

自引率

0.00%

发文量

期刊最新文献

Open Problem: A Formula for Calculation of the Voronoi S-region Volume Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input Delaunay Triangulations on the Word RAM: Towards a Practical Worst-Case Optimal Algorithm Anomaly Occurrences in Quasi-triangulations and Beta-complexes A Sweepline Algorithm for Higher Order Voronoi Diagrams