Author:
Bhattacharya Binay K.,Das Gautam,Mukhopadhyay Asish,Narasimhan Giri
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference29 articles.
1. An O(nlogn) algorithm for finding a shortest central link segment;Aleksandrov;Internat. J. Comput. Geom. Appl.,2000
2. An optimal algorithm for determining the visibility of a polygon from an edge;Avis;IEEE Trans. Comput.,1981
3. Computing in linear time an internal line segment from which a simple polygon is weakly internally visible;Bhattacharya,1995
4. Computing a shortest weakly externally visible line segment for a simple polygon;Bhattacharya;Internat. J. Comput. Geom. Appl.,1999
5. External visibility;Buchman;Pacific J. Math.,1976
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献