Title of article :
Fast computation of shortest watchman routes in simple polygons
Author/Authors :
Xuehou Tan، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2001
Pages :
7
From page :
27
To page :
33
Keywords :
computational geometry , Algorithms , Adjustments , Watchman routes
Journal title :
Information Processing Letters
Serial Year :
2001
Journal title :
Information Processing Letters
Record number :
129308
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129308
بازگشت