Searching for "Optimally computing a shortest weakly visible line segment inside a simple polygon." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Optimally Computing a Shortest Weakly Visible Line Segment Inside a Simple Polygon
by Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan — 2002 — Computational Geometry: Theory and Applications
…Optimally computing a shortest weakly visible line segment inside a simple polygon ? Binay K…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB