A linear time algorithm for finding all farthest neighbors in a convex polygon
1989 ◽
Vol 31
(1)
◽
pp. 17-20
◽
1992 ◽
Vol 02
(02)
◽
pp. 191-214
◽
Keyword(s):
2009 ◽
Vol 19
(04)
◽
pp. 357-370
Keyword(s):
2000 ◽
Vol 10
(01)
◽
pp. 1-40
◽
1999 ◽
Vol 09
(01)
◽
pp. 81-96
◽
Keyword(s):
1989 ◽
Vol 4
(6)
◽
pp. 591-604
◽
2003 ◽
Vol 13
(05)
◽
pp. 439-445
◽