Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan. Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom., 23(1):1-29, 2002.
@article{BhattacharyaDMN02,
title = {Optimally computing a shortest weakly visible line segment inside a simple polygon},
author = {Binay K. Bhattacharya and Gautam Das and Asish Mukhopadhyay and Giri Narasimhan},
year = {2002},
researchr = {https://researchr.org/publication/BhattacharyaDMN02},
cites = {0},
citedby = {0},
journal = {Comput. Geom.},
volume = {23},
number = {1},
pages = {1-29},
}