( en | de | ru )

 

Disambiguation of "Tan, Xuehou"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Point Movement for Covering Circular Regions.

, , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Albert Tan

Dao Tan

Ming Tan

Vivien Tan

Tangsheng Tan

 

Other publications of authors with the same name

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