A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible
2005 ◽
pp. 412-424
◽
1999 ◽
Vol 09
(01)
◽
pp. 81-96
◽
Keyword(s):
2000 ◽
Vol 11
(03)
◽
pp. 365-371
◽
Keyword(s):
2012 ◽
Vol 160
(3)
◽
pp. 210-217
◽
Keyword(s):