Author:
Das Gautam,Heffernan Paul J.,Narasimhan Giri
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference17 articles.
1. An optimal algorithm for determining the visibility of a polygon from an edge;Avis;IEEE Trans. Comput.,1981
2. Triangulating a simple polygon in linear time;Chazelle;Discrete Comput. Geom.,1991
3. An optimal parallel algorithm for detecting weak visibility of a simple polygon;Chen,1992
4. to appear in Internat. J. Comput. Geom. Appl.
5. Optimally computing the shortest weakly visible subedge of a simple polygon;Chen,1992
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A sufficient condition for visibility paths in simple polygons;International Journal of Computer Mathematics: Computer Systems Theory;2023-01-19
2. OODT: Obstacle Aware Opportunistic Data Transmission for Cognitive Radio Ad Hoc Networks;IEEE Transactions on Communications;2020-06
3. Characterizing Link-2 LR-Visibility Polygons and Related Problems;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-02-01
4. Walking in streets with minimal sensing;Journal of Combinatorial Optimization;2014-09-20
5. Characterizing and recognizing LR-visibility polygons;Discrete Applied Mathematics;2014-03