Xuehou Tan

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 25

Top Topics

Digital Convexity

Related Problems

Delaunay Triangulations

Top Venues

J. Comb. Optim.

Theor. Comput. Sci.

Publications

Xuehou Tan
An Optimal and Practical Algorithm for the Planar 2-Center Problem. TAMC (2024)
Xuehou Tan, Charatsanyakul Sakthip, Bo Jiang, Shimao Liu
Improved stretch factor of Delaunay triangulations of points in convex position. J. Comb. Optim. 45 (1) (2023)
Xuehou Tan, Qi Wei
Improved exploration of unknown polygons. Theor. Comput. Sci. 922 (2022)
Xuehou Tan, Rong Chen
Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters. TAMC (2022)
Xuehou Tan
Simple Proof of the Lower Bound on the Average Distance from the Fermat-Weber Center of a Convex Body. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2022)
Qi Wei, Jie Sun, Xuehou Tan, Xiaolin Yao, Yonggong Ren
The simple grid polygon exploration problem. J. Comb. Optim. 41 (3) (2021)
Xuehou Tan, Bo Jiang
On the upper bound on the average distance from the Fermat-Weber center of a convex body. Comput. Geom. 97 (2021)
Xuehou Tan
The touring rays and related problems. Theor. Comput. Sci. 866 (2021)
Xuehou Tan
Polynomial-Time Algorithms for the Touring Rays and Related Problems. AAIM (2020)
Xuehou Tan, Bo Jiang
Computing simple paths from given points inside a polygon. Discret. Appl. Math. 252 (2019)
Xuehou Tan, Charatsanyakul Sakthip, Bo Jiang
Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position. COCOA (2019)
Qi Wei, Xuehou Tan, Yonggong Ren
Walking an Unknown Street with Limited Sensing. Int. J. Pattern Recognit. Artif. Intell. 33 (13) (2019)
Xuehou Tan, Bo Jiang
Characterizing Link-2 LR-Visibility Polygons and Related Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2) (2019)
Xuehou Tan, Bo Jiang
The Touring Polygons Problem Revisited. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2018)
Xuehou Tan, Bo Jiang
An improved algorithm for computing a shortest watchman route for lines. Inf. Process. Lett. 131 (2018)
Photchchara Pisantechakool, Xuehou Tan
The capture time of a planar graph. J. Comb. Optim. 36 (4) (2018)
Xuehou Tan, Bo Jiang
Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem. COCOON (2017)
Photchchara Pisantechakool, Xuehou Tan
On the Conjecture of the Smallest 3-Cop-Win Planar Graph. TAMC (2017)
Xuehou Tan, Bo Jiang
Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems. TAMC (2017)
Photchchara Pisantechakool, Xuehou Tan
On the Capture Time of Cops and Robbers Game on a Planar Graph. COCOA (2016)
Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang
Evacuating from an Unknown Affected Area. Int. J. Pattern Recognit. Artif. Intell. 30 (7) (2016)
Qi Wei, Xuehou Tan, Bo Jiang
Competitive Strategies for Evacuating from an Unknown Affected Area. IEICE Trans. Inf. Syst. (10) (2016)
Danny Ziyi Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
Optimal Point Movement for Covering Circular Regions. Algorithmica 72 (2) (2015)
Xuehou Tan, Qi Wei
An Improved On-line Strategy for Exploring Unknown Polygons. COCOA (2015)
Photchchara Pisantechakool, Xuehou Tan
A New Distributed Algorithm for Computing a Dominating Set on Grids. FAW (2015)
Xuehou Tan, Bo Jiang
Finding Simple Paths on Given Points in a Polygonal Region. FAW (2014)
Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang
On-Line Strategies for Evacuating from a Convex Region in the Plane. COCOA (2014)
Xuehou Tan, Bo Jiang
Optimum sweeps of simple polygons with two guards. Inf. Process. Lett. 114 (3) (2014)
Xuehou Tan, Bo Jiang
Minimization of the maximum distance between the two guards patrolling a polygonal region. Theor. Comput. Sci. 532 (2014)
Xuehou Tan, Bo Jiang, Jing Zhang
Characterizing and recognizing LR-visibility polygons. Discret. Appl. Math. 165 (2014)
Xuehou Tan, Gangshan Wu
Approximation algorithms for cutting a convex polyhedron out of a sphere. Theor. Comput. Sci. 508 (2013)
Xuehou Tan, Bo Jiang
A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body. COCOA (2013)
Xuehou Tan, Jing Zhang, Bo Jiang
A Characterization of Link-2 LR-visibility Polygons with Applications. JCDCGG (2013)
Xuehou Tan, Bo Jiang
Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region. FAW-AAIM (2012)
Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
Optimal Point Movement for Covering Circular Regions. ISAAC (2012)
Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
Optimal Point Movement for Covering Circular Regions CoRR (2011)
Bo Jiang, Xuehou Tan
Searching for mobile intruders in circular corridors by two 1-searchers. Discret. Appl. Math. 159 (16) (2011)
Xuehou Tan, Gangshan Wu
Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere. FAW-AAIM (2011)
Xuehou Tan, Bo Jiang
Optimum Sweeps of Simple Polygons with Two Guards. FAW (2010)
Xuehou Tan, Jing Zhang, Bo Jiang
Simple Characterization of LR-visibility Polygons. CGGA (2010)
Xuehou Tan, Gangshan Wu
New Algorithms for Barrier Coverage with Mobile Sensors. FAW (2010)
Bo Jiang, Xuehou Tan
Searching a Circular Corridor with Two Flashlights. TAMC (2009)
Xuehou Tan
A unified and efficient solution to the room search problem. Comput. Geom. 40 (1) (2008)
Xuehou Tan, Bo Jiang
Searching a Polygonal Region by Two Guards. J. Comput. Sci. Technol. 23 (5) (2008)
Xuehou Tan
An efficient algorithm for the three-guard problem. Discret. Appl. Math. 156 (17) (2008)
Xuehou Tan
Sweeping simple polygons with the minimum number of chain guards. Inf. Process. Lett. 102 (2-3) (2007)
Xuehou Tan
Searching a Polygonal Region by Two Guards. TAMC (2007)
Xuehou Tan
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. Theor. Comput. Sci. 384 (1) (2007)
Xuehou Tan
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. TAMC (2006)
Jin Akiyama, Mikio Kano, Xuehou Tan
Editorial. Comput. Geom. 34 (1) (2006)
Xuehou Tan
A 2-approximation algorithm for the zookeeper's problem. Inf. Process. Lett. 100 (5) (2006)
Xuehou Tan
Approximation Algorithms for Cutting Out Polygons with Lines and Rays. COCOON (2005)
Xuehou Tan
Approximation algorithms for the watchman route and zookeeper's problems. Discret. Appl. Math. 136 (2-3) (2004)
Xuehou Tan
The Two-Guard Problem Revisited and Its Generalization. ISAAC (2004)
Xuehou Tan
An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. JCDCG (2004)
Xuehou Tan
A Characterization of Polygonal Regions Searchable from the Boundary. IJCCGGT (2003)
Xuehou Tan, Tomio Hirata
Finding shortest safari routes in simple polygons. Inf. Process. Lett. 87 (4) (2003)
Xuehou Tan
Finding an Optimal Bridge Between Two Polygons. Int. J. Comput. Geom. Appl. 12 (3) (2002)
Xuehou Tan
Fast computation of shortest watchman routes in simple polygons. Inf. Process. Lett. 77 (1) (2001)
Xuehou Tan
Approximation Algorithms for the Watchman Route and Zookeeper's Problems. COCOON (2001)
Xuehou Tan
Optimal computation of the Voronoi diagram of disjoint clusters. Inf. Process. Lett. 79 (3) (2001)
Xuehou Tan
Finding an Optimal Bridge between Two Polygons. COCOON (2001)
Xuehou Tan
Shortest zookeeper's routes in simple polygons. Inf. Process. Lett. 77 (1) (2001)
Xuehou Tan
Efficient Algorithms for Searching a Polygonal Room with a Door. JCDCG (2000)
Xuehou Tan
On optimal bridges between two convex regions. Inf. Process. Lett. 76 (4-6) (2000)
Xuehou Tan
-Searcher. ISAAC (2000)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes". Int. J. Comput. Geom. Appl. 9 (3) (1999)
Xuehou Tan, Xiaoyu Song
Routing Multiterminal Nets on a Hexagonal Grid. Discret. Appl. Math. 90 (1-3) (1999)
Xuehou Tan
Edge Guards in Straight Walkable Polygons. Int. J. Comput. Geom. Appl. 9 (1) (1999)
Xuehou Tan
An Efficient Solution to the Corridor Search Problem. JCDCG (1998)
Xuehou Tan, Xiaoyu Song
Hexagonal Routings of Multiterminal Nets. COCOON (1997)
Xuehou Tan, Binhai Zhu
Two-Guarding a Rectilinear Polygon. COCOON (1996)
Xuehou Tan, Xiaoyu Song
Hexagonal Three-Layer Channel Routing. Inf. Process. Lett. 55 (4) (1995)
Xiaoyu Song, Xuehou Tan
An optimal channel-routing algorithm in the times square model. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13 (7) (1994)
Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama
Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4 (1994)
Xuehou Tan, Tomio Hirata
Shortest Safari Routes in Simple Polygon. ISAAC (1994)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
An incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geom. Appl. 3 (4) (1993)
Xuehou Tan, Tomio Hirata
Constructing Shortest Watchman Routes by Divide-and-Conquer. ISAAC (1993)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
The Intersection Searching Problem for c-Oriented Polygons. Inf. Process. Lett. 37 (4) (1991)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
An Incremental Algorithm for Constructing Shortest Watchman Routes. ISA (1991)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
Spatial Point Location and Its Applications. SIGAL International Symposium on Algorithms (1990)