( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Point Movement for Covering Circular Regions.

, , , и . Algorithmica, 72 (2): 379-399 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Albert Tan

Dao Tan

Vivien Tan

Ming Tan

Tangsheng Tan

 

Другие публикации лиц с тем же именем

Optimum sweeps of simple polygons with two guards., и . Inf. Process. Lett., 114 (3): 130-136 (2014)Polynomial-Time Algorithms for the Touring Rays and Related Problems.. AAIM, том 12290 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2020)An incremental algorithm for constructing shortest watchman routes., , и . Int. J. Comput. Geom. Appl., 3 (4): 351-365 (1993)A linear-time 2-approximation algorithm for the watchman route problem for simple polygons.. Theor. Comput. Sci., 384 (1): 92-103 (2007)Searching a Simple Polygon by a k-Searcher.. ISAAC, том 1969 из Lecture Notes in Computer Science, стр. 503-514. Springer, (2000)A Characterization of Link-2 LR-visibility Polygons with Applications., , и . JCDCGG, том 8845 из Lecture Notes in Computer Science, стр. 161-172. Springer, (2013)New Algorithms for Barrier Coverage with Mobile Sensors., и . FAW, том 6213 из Lecture Notes in Computer Science, стр. 327-338. Springer, (2010)On optimal bridges between two convex regions.. Inf. Process. Lett., 76 (4-6): 163-168 (2000)Finding shortest safari routes in simple polygons., и . Inf. Process. Lett., 87 (4): 179-186 (2003)Characterizing Link-2 LR-Visibility Polygons and Related Problems., и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 102-A (2): 423-429 (2019)