( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Characterization of Link-2 LR-visibility Polygons with Applications.

, , и . JCDCGG, том 8845 из Lecture Notes in Computer Science, стр. 161-172. Springer, (2013)

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

 

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

Polynomial-Time Algorithms for the Touring Rays and Related Problems.. AAIM, том 12290 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2020)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)Optimum sweeps of simple polygons with two guards., и . Inf. Process. Lett., 114 (3): 130-136 (2014)New Algorithms for Barrier Coverage with Mobile Sensors., и . FAW, том 6213 из Lecture Notes in Computer Science, стр. 327-338. Springer, (2010)Finding shortest safari routes in simple polygons., и . Inf. Process. Lett., 87 (4): 179-186 (2003)Optimal computation of the Voronoi diagram of disjoint clusters.. Inf. Process. Lett., 79 (3): 115-119 (2001)An improved algorithm for computing a shortest watchman route for lines., и . Inf. Process. Lett., (2018)Fast computation of shortest watchman routes in simple polygons.. Inf. Process. Lett., 77 (1): 27-33 (2001)Optimum Sweeps of Simple Polygons with Two Guards., и . FAW, том 6213 из Lecture Notes in Computer Science, стр. 304-315. Springer, (2010)