A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint. A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, 2nd Workshop WADS 91, Ottawa, Canada, August 14-16, 1991, Proceedings. Volume 519 of Lecture Notes in Computer Science, pages 412-424, Springer, 1991.

This author has not been identified. Look up 'Binay K. Bhattacharya' in GoogleThis author has not been identified. Look up 'Asish Mukhopadhyay' in GoogleThis author has not been identified. Look up 'Godfried T. Toussaint' in Google

runs on WebDSL