default search action
"Optimally computing a shortest weakly visible line segment inside a simple ..."
Binay K. Bhattacharya et al. (2002)
- 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)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.