Optimally computing a shortest weakly visible line segment inside a simple polygon

From MaRDI portal
Publication:1614066

DOI10.1016/S0925-7721(01)00058-XzbMath1003.65013OpenAlexW2022832678MaRDI QIDQ1614066

Giri Narasimhan, Asish Kumar Mukhopadhyay, Gautam K. Das, Binay K. Bhattacharya

Publication date: 3 September 2002

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00058-x



Related Items



Cites Work