Xuehou Tan

发表

A Characterization of Link-2 LR-visibility Polygons with Applications

Jing Zhang, Bo Jiang, Xuehou Tan, 2013, JCDCGG.

Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem

Bo Jiang, Xuehou Tan, 2017, COCOON.

Shortest Safari Routes in Simple Polygon

Tomio Hirata, Xuehou Tan, 1994, ISAAC.

Searching a Simple Polygon by a k-Searcher

Xuehou Tan, 2000, ISAAC.

On the Capture Time of Cops and Robbers Game on a Planar Graph

Xuehou Tan, Photchchara Pisantechakool, 2016, COCOA.

An incremental algorithm for constructing shortest watchman routes

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1993, Int. J. Comput. Geom. Appl..

Approximation Algorithms for Cutting Out Polygons with Lines and Rays

Xuehou Tan, 2005, COCOON.

A Note on the Edge Guard Problem for Spiral Polygons

Xuehou Tan, 2000 .

Characterizing Link-2 LR-Visibility Polygons and Related Problems

Bo Jiang, Xuehou Tan, 2019, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Polynomial-Time Algorithms for the Touring Rays and Related Problems

Xuehou Tan, 2020, AAIM.

Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere

Xuehou Tan, Gangshan Wu, Gangshan Wu, 2011, FAW-AAIM.

Shortest zookeeper's routes in simple polygons

Xuehou Tan, 2001, Inf. Process. Lett..

An Optimal Algorithm for the 1-Searchability of Polygonal Rooms

Xuehou Tan, 2004, JCDCG.

Finding shortest safari routes in simple polygons

Tomio Hirata, Xuehou Tan, 2003, Inf. Process. Lett..

Characterizing and recognizing LR-visibility polygons

Jing Zhang, Bo Jiang, Xuehou Tan, 2014, Discret. Appl. Math..

Finding Simple Paths on Given Points in a Polygonal Region

Bo Jiang, Xuehou Tan, 2014, FAW.

Computing simple paths from given points inside a polygon

Bo Jiang, Xuehou Tan, X. Tan, 2019, Discret. Appl. Math..

Searching a Polygonal Region by Two Guards

Xuehou Tan, 2007, TAMC.

An efficient algorithm for the three-guard problem

Xuehou Tan, X. Tan, 2008, Discret. Appl. Math..

Searching for mobile intruders in circular corridors by two 1-searchers

Bo Jiang, Xuehou Tan, 2011, Discret. Appl. Math..

Optimal computation of the Voronoi diagram of disjoint clusters

Xuehou Tan, 2001, Inf. Process. Lett..

Efficient Algorithms for Searching a Polygonal Room with a Door

Xuehou Tan, 2000, JCDCG.

The Touring Polygons Problem Revisited

Bo Jiang, Xuehou Tan, 2018, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1994 .

Finding an Optimal Bridge between Two Polygons

Xuehou Tan, 2001, COCOON.

Routing Multiterminal Nets on a Hexagonal Grid

Xiaoyu Song, Xuehou Tan, 1999, Discret. Appl. Math..

A 2-approximation algorithm for the zookeeper's problem

Xuehou Tan, 2006, Inf. Process. Lett..

Optimal Point Movement for Covering Circular Regions

Haitao Wang, Xuehou Tan, Danny Ziyi Chen, 2012, ISAAC.

The Two-Guard Problem Revisited and Its Generalization

Xuehou Tan, X. Tan, 2004, ISAAC.

Optimum Sweeps of Simple Polygons with Two Guards

Bo Jiang, Xuehou Tan, 2010, FAW.

New Algorithms for Barrier Coverage with Mobile Sensors

Xuehou Tan, Gangshan Wu, 2010, FAW.

Hexagonal Routings of Multiterminal Nets

Xiaoyu Song, Xuehou Tan, 1997, COCOON.

Spatial Point Location and Its Applications

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1990, SIGAL International Symposium on Algorithms.

A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body

Bo Jiang, Xuehou Tan, 2013, COCOA.

The net adding problem

Xuehou Tan, Xiaoyu Song, 1994 .

Approximation Algorithms for the Watchman Route and Zookeeper's Problems

Xuehou Tan, 2001, COCOON.

Optimal Point Movement for Covering Circular Regions

Haitao Wang, Xuehou Tan, Danny Ziyi Chen, 2013, Algorithmica.

Computational Geometry, Graphs and Applications: International Conference,CGGA 2010, Dalian, China, November 3-6, 2010, Revised, Selected Papers ... Computer Science and General Issues)

Jin Akiyama, Mikio Kano, Xuehou Tan, 2011 .

An Efficient Solution to the Corridor Search Problem

Xuehou Tan, X. Tan, 1998, JCDCG.

Constructing Shortest Watchman Routes by Divide-and-Conquer

Tomio Hirata, Xuehou Tan, 1993, ISAAC.

The capture time of a planar graph

Xuehou Tan, Photchchara Pisantechakool, 2018, J. Comb. Optim..

Optimum sweeps of simple polygons with two guards

Bo Jiang, Xuehou Tan, X. Tan, 2010, Inf. Process. Lett..

A unified and efficient solution to the room search problem

Xuehou Tan, 2008, Comput. Geom..

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Binhai Zhu, Xuehou Tan, Michael Fellows, 2013, Lecture Notes in Computer Science.

Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications

Jin Akiyama, Mikio Kano, Xuehou Tan, 2010 .

A Characterization of Polygonal Regions Searchable from the Boundary

Xuehou Tan, 2003, IJCCGGT.

Walking an Unknown Street with Limited Sensing

Xuehou Tan, Qi Wei, Yonggong Ren, 2019, Int. J. Pattern Recognit. Artif. Intell..

Searching a Polygonal Region by Two Guards

Bo Jiang, Xuehou Tan, 2008, Journal of Computer Science and Technology.

Sweeping simple polygons with the minimum number of chain guards

Xuehou Tan, 2007, Inf. Process. Lett..

Fast computation of shortest watchman routes in simple polygons

Xuehou Tan, X. Tan, 2001, Inf. Process. Lett..

Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems

Bo Jiang, Xuehou Tan, 2017, TAMC.

Linear-Time 2-Approximation Algorithm for the Watchman Route Problem

Xuehou Tan, 2006, TAMC.

Approximation algorithms for the watchman route and zookeeper's problems

Xuehou Tan, 2004, Discret. Appl. Math..

An Improved On-line Strategy for Exploring Unknown Polygons

Xuehou Tan, Qi Wei, 2015, COCOA.

On optimal bridges between two convex regions

Xuehou Tan, 2000, Inf. Process. Lett..

Computational Geometry, Graphs and Applications

Jin Akiyama, Mikio Kano, Xuehou Tan, 2011, Lecture Notes in Computer Science.

Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position

Xuehou Tan, Charatsanyakul Sakthip, Bo Jiang, 2019, COCOA.

On the Conjecture of the Smallest 3-Cop-Win Planar Graph

Xuehou Tan, Photchchara Pisantechakool, 2017, TAMC.

A linear-time 2-approximation algorithm for the watchman route problem for simple polygons

Xuehou Tan, X. Tan, 2007, Theor. Comput. Sci..

Two-Guarding a Rectilinear Polygon

Binhai Zhu, Xuehou Tan, B. Zhu, 1996, COCOON.

Searching a Circular Corridor with Two Flashlights

Bo Jiang, Xuehou Tan, 2009, TAMC.

Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes"

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1991, Int. J. Comput. Geom. Appl..

Edge Guards in Straight Walkable Polygons

Xuehou Tan, X. Tan, 1999, Int. J. Comput. Geom. Appl..

Complexity of Projected Images of Convex Subdivisions

Jirí Matousek, Takeshi Tokuyama, Tomio Hirata, 1994, Comput. Geom..

The Intersection Searching Problem for c-Oriented Polygons

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1991, Inf. Process. Lett..

Evacuating from an Unknown Affected Area

Lijuan Wang, Bo Jiang, Xuehou Tan, 2016, Int. J. Pattern Recognit. Artif. Intell..

Minimization of the maximum distance between the two guards patrolling a polygonal region

Bo Jiang, Xuehou Tan, 2014, Theor. Comput. Sci..

Finding an Optimal Bridge Between Two Polygons

Xuehou Tan, X. Tan, 2001, Int. J. Comput. Geom. Appl..

Hexagonal Three-Layer Channel Routing

Xiaoyu Song, Xuehou Tan, 1995, Inf. Process. Lett..

A New Distributed Algorithm for Computing a Dominating Set on Grids

Xuehou Tan, Photchchara Pisantechakool, 2015, FAW.

Simple Characterization of LR-visibility Polygons

Jing Zhang, Bo Jiang, Xuehou Tan, 2010, CGGA.

On-Line Strategies for Evacuating from a Convex Region in the Plane

Lijuan Wang, Bo Jiang, Xuehou Tan, 2014, COCOA.

Competitive Strategies for Evacuating from an Unknown Affected Area

Bo Jiang, Xuehou Tan, Qi Wei, 2016, IEICE Trans. Inf. Syst..

Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry

Jin Akiyama, Mikio Kano, Xuehou Tan, 2004 .

Approximation algorithms for cutting a convex polyhedron out of a sphere

Xuehou Tan, Gangshan Wu, 2013, Theor. Comput. Sci..

An improved algorithm for computing a shortest watchman route for lines

Bo Jiang, Xuehou Tan, X. Tan, 2018, Inf. Process. Lett..

An optimal on-line strategy for walking in streets with minimal sensing

Qi Wei, Xuehou Tan, 2016, 2016 2nd IEEE International Conference on Computer and Communications (ICCC).

Minimization of the maximum distance between the two guards patrolling a polygonal region

Bo Jiang, Xuehou Tan, X. Tan, 2012, Theor. Comput. Sci..

Simple Proof of the Lower Bound on the Average Distance from the Fermat-Weber Center of a Convex Body

Xuehou Tan, X. Tan, 2022, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

On the upper bound on the average distance from the Fermat-Weber center of a convex body

Bo Jiang, Xuehou Tan, 2021, Comput. Geom..

The simple grid polygon exploration problem

Xuehou Tan, Qi Wei, Yonggong Ren, 2021, J. Comb. Optim..

The touring rays and related problems

Xuehou Tan, 2021, Theor. Comput. Sci..

An On-Line Strategy of Groups Evacuation from a Convex Region in the Plane

Xuehou Tan, Bo Jiang, Yuan Liu, 2015 .