针对简单多边形可见性问题，提出了一种耗时O(log N log log N)的RMESH算法

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI:10.1109/ISPAN.1994.367152

Sung-Ryul Kim, Kunsoo Park, Yookun Cho

{"title":"针对简单多边形可见性问题，提出了一种耗时O(log N log log N)的RMESH算法","authors":"Sung-Ryul Kim, Kunsoo Park, Yookun Cho","doi":"10.1109/ISPAN.1994.367152","DOIUrl":null,"url":null,"abstract":"In this paper we consider the simple polygon visibility problem: Given a simple polygon P with N vertices and a point z in the interior of the polygon, find all the boundary points of P that are visible from z. We present an O(logN loglogN) time algorithm that solves the simple polygon visibility problem on a /spl radic/N/spl times//spl radic/N RMESH. Previously, the best known algorithm for the problem on a /spl radic/N/spl times//spl radic/N RMESH takes O(log/sup 2/ N) time.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem\",\"authors\":\"Sung-Ryul Kim, Kunsoo Park, Yookun Cho\",\"doi\":\"10.1109/ISPAN.1994.367152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the simple polygon visibility problem: Given a simple polygon P with N vertices and a point z in the interior of the polygon, find all the boundary points of P that are visible from z. We present an O(logN loglogN) time algorithm that solves the simple polygon visibility problem on a /spl radic/N/spl times//spl radic/N RMESH. Previously, the best known algorithm for the problem on a /spl radic/N/spl times//spl radic/N RMESH takes O(log/sup 2/ N) time.<<ETX>>\",\"PeriodicalId\":142405,\"journal\":{\"name\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.1994.367152\",\"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 of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.1994.367152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文考虑简单多边形的可见性问题:给定一个具有N个顶点的简单多边形P，在多边形的内部有一个点z，找出P的所有边界点在z上可见。我们提出了一个O(logN loggn)时间的算法，该算法在a /spl径向/N/spl径向/N RMESH上解决了简单多边形可见性问题。在此之前，最著名的解决/spl radic/N/spl times//spl radic/N RMESH问题的算法需要O(log/sup 2/ N)时间。

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

查看原文本刊更多论文

An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem

In this paper we consider the simple polygon visibility problem: Given a simple polygon P with N vertices and a point z in the interior of the polygon, find all the boundary points of P that are visible from z. We present an O(logN loglogN) time algorithm that solves the simple polygon visibility problem on a /spl radic/N/spl times//spl radic/N RMESH. Previously, the best known algorithm for the problem on a /spl radic/N/spl times//spl radic/N RMESH takes O(log/sup 2/ N) time.<>

求助全文

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

来源期刊

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

自引率

0.00%

发文量