| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Xuehou Tan, Bo Jiang |
Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region.  |
FAW-AAIM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu |
Optimal Point Movement for Covering Circular Regions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Bo Jiang, Xuehou Tan |
Searching for mobile intruders in circular corridors by two 1-searchers. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Gangshan Wu |
Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere. |
FAW-AAIM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin Akiyama, Jiang Bo, Mikio Kano, Xuehou Tan (eds.) |
Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers |
CGGA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Gangshan Wu |
New Algorithms for Barrier Coverage with Mobile Sensors. |
FAW |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Bo Jiang |
Optimum Sweeps of Simple Polygons with Two Guards. |
FAW |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Jing Zhang, Bo Jiang |
Simple Characterization of LR-visibility Polygons. |
CGGA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Jiang, Xuehou Tan |
Searching a Circular Corridor with Two Flashlights. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
A unified and efficient solution to the room search problem. |
Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
An efficient algorithm for the three-guard problem. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Bo Jiang |
Searching a Polygonal Region by Two Guards. |
J. Comput. Sci. Technol. |
2008 |
DBLP DOI BibTeX RDF |
polygon search problem, two-guard problem, robotics, computational geometry, visibility |
| 1 | Xuehou Tan |
Sweeping simple polygons with the minimum number of chain guards. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Searching a Polygonal Region by Two Guards. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
A 2-approximation algorithm for the zookeeper's problem. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin Akiyama, Mikio Kano, Xuehou Tan |
Editorial. |
Comput. Geom. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Approximation Algorithms for Cutting Out Polygons with Lines and Rays. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin Akiyama, Mikio Kano, Xuehou Tan (eds.) |
Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers |
JCDCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Xuehou Tan |
Approximation algorithms for the watchman route and zookeeper's problems. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
The Two-Guard Problem Revisited and Its Generalization. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. |
JCDCG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Tomio Hirata |
Finding shortest safari routes in simple polygons. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
A Characterization of Polygonal Regions Searchable from the Boundary. |
IJCCGGT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Finding an Optimal Bridge Between Two Polygons. |
Int. J. Comput. Geometry Appl. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Optimal computation of the Voronoi diagram of disjoint clusters. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Shortest zookeeper's routes in simple polygons. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Fast computation of shortest watchman routes in simple polygons. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Finding an Optimal Bridge between Two Polygons. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Approximation Algorithms for the Watchman Route and Zookeeper's Problems. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
On optimal bridges between two convex regions. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Searching a Simple Polygon by a k-Searcher. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Efficient Algorithms for Searching a Polygonal Room with a Door. |
JCDCG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Xiaoyu Song |
Routing Multiterminal Nets on a Hexagonal Grid. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan |
Edge Guards in Straight Walkable Polygons. |
Int. J. Comput. Geometry Appl. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki |
Corrigendum to ``An Incremental Algorithm for Constructing Shortest Watchman Routes''. |
Int. J. Comput. Geometry Appl. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Xuehou Tan |
An Efficient Solution to the Corridor Search Problem. |
JCDCG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Xiaoyu Song |
Hexagonal Routings of Multiterminal Nets. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Binhai Zhu |
Two-Guarding a Rectilinear Polygon. |
COCOON |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Xiaoyu Song |
Hexagonal Three-Layer Channel Routing. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoyu Song, Xuehou Tan |
An optimal channel-routing algorithm in the times square model. |
IEEE Trans. on CAD of Integrated Circuits and Systems |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama |
Complexity of Projected Images of Convex Subdivisions. |
Comput. Geom. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Tomio Hirata |
Shortest Safari Routes in Simple Polygon. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki |
An incremental algorithm for constructing shortest watchman routes. |
Int. J. Comput. Geometry Appl. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Xuehou Tan, Tomio Hirata |
Constructing Shortest Watchman Routes by Divide-and-Conquer. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki |
The Intersection Searching Problem for c-Oriented Polygons. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki |
An Incremental Algorithm for Constructing Shortest Watchman Routes. |
ISA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki |
Spatial Point Location and Its Applications. |
SIGAL International Symposium on Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")