Characterizing LR-visibility polygons and related problems☆☆The extended abstract of this paper was presented at the Tenth Canadian Conference on Computational Geometry, 1998.-Reference-Cited by-同舟云学术

Characterizing LR-visibility polygons and related problems☆☆The extended abstract of this paper was presented at the Tenth Canadian Conference on Computational Geometry, 1998.

Published:2001-02 Issue:1 Volume:18 Page:19-36
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Bhattacharya Binay K.,Ghosh Subir Kumar

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference17 articles.

1. Visibility in the plane;Asano,199919

2. An optimal algorithm for determining the visibility of a polygon from an edge;Avis;IEEE Trans. Comput.,1981

3. Triangulating a simple polygon in linear time, Technical Report No. CS-TR-264-90;Chazelle,1990

4. Triangulating a simple polygon in linear time;Chazelle;Discrete Comput. Geom.,1991

5. Optimally computing the shortest weakly visible subedge of a simple polygon;Chen,1993

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Characterizing Link-2 LR-Visibility Polygons and Related Problems;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-02-01

2. Characterizing and recognizing LR-visibility polygons;Discrete Applied Mathematics;2014-03

3. A Characterization of Link-2 LR-visibility Polygons with Applications;Lecture Notes in Computer Science;2014

4. Searching for mobile intruders in circular corridors by two 1-searchers;Discrete Applied Mathematics;2011-09

5. Simple Characterization of LR-visibility Polygons;Lecture Notes in Computer Science;2011