平面上线段相交的最优算法

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science Pub Date : 1988-10-24 DOI:10.1145/147508.147511

B. Chazelle, H. Edelsbrunner

{"title":"平面上线段相交的最优算法","authors":"B. Chazelle, H. Edelsbrunner","doi":"10.1145/147508.147511","DOIUrl":null,"url":null,"abstract":"The authors present the first optimal algorithm for the following problem: given n line segments in the plane, compute all k pairwise intersections in O(n log n+k) time. Within the same asymptotic cost the algorithm will also compute the adjacencies of the planar subdivision induced by the segments, which is a useful data structure for contour-filling on raster devices.<<ETX>>","PeriodicalId":113255,"journal":{"name":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"440","resultStr":"{\"title\":\"An optimal algorithm for intersecting line segments in the plane\",\"authors\":\"B. Chazelle, H. Edelsbrunner\",\"doi\":\"10.1145/147508.147511\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present the first optimal algorithm for the following problem: given n line segments in the plane, compute all k pairwise intersections in O(n log n+k) time. Within the same asymptotic cost the algorithm will also compute the adjacencies of the planar subdivision induced by the segments, which is a useful data structure for contour-filling on raster devices.<<ETX>>\",\"PeriodicalId\":113255,\"journal\":{\"name\":\"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"440\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/147508.147511\",\"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 1988] 29th Annual Symposium on Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/147508.147511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 440

摘要

作者提出了以下问题的第一个最优算法:给定平面上的n个线段，在O(n log n+k)时间内计算所有k对交点。在相同的渐近代价内，该算法还将计算由线段引起的平面细分的邻接关系，这是在光栅设备上进行轮廓填充的有用数据结构

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

查看原文

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

本刊更多论文

An optimal algorithm for intersecting line segments in the plane

The authors present the first optimal algorithm for the following problem: given n line segments in the plane, compute all k pairwise intersections in O(n log n+k) time. Within the same asymptotic cost the algorithm will also compute the adjacencies of the planar subdivision induced by the segments, which is a useful data structure for contour-filling on raster devices.<>

求助全文

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

来源期刊

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

自引率

0.00%

发文量

期刊最新文献

Combinatorial complexity bounds for arrangements of curves and surfaces Genus g graphs have pagenumber O( square root g) Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs Covering polygons is hard New upper bounds in Klee's measure problem