Get started
Author

Xuehou Tan

Observed names: Tan, Xuehou, X. Tan, XUEHOU TAN, Xue-Hou Tan, Xuehou TAN
ORCID: 0000-0002-9828-9927
Observed ORCID: 0000-0002-9828-9927
OpenAlex ID: A5023193789
Discrete and Computational Geometry
2005 · Akiyama, Jin, Tan, Xuehou, et al. · Lecture notes in computer science · 103
Corrigendum to "an Incremental Algorithm for Constructing Shortest Watchman Routes"
1999 · XUEHOU TAN, TOMIO HIRATA, et al. · International Journal of Computational Geometry & Applications · 63
Fast computation of shortest watchman routes in simple polygons
2001 · Xuehou Tan · Information Processing Letters · 60
An Incremental Algorithm for Constructing Shortest Watchman Routes
1993 · XUEHOU TAN, TOMIO HIRATA, et al. · International Journal of Computational Geometry & Applications · 50
Approximation algorithms for the watchman route and zookeeper's problems
2003 · Xuehou Tan · Discrete Applied Mathematics · 38
PDF
Finding shortest safari routes in simple polygons
2003 · Xuehou Tan, Tomio Hirata · Information Processing Letters · 36
Constructing shortest watchman routes by divide-and-conquer
1993 · Xuehou Tan, Tomio Hirata · Lecture notes in computer science · 33
New Algorithms for Barrier Coverage with Mobile Sensors
2010 · Xuehou Tan, Gangshan Wu · Lecture notes in computer science · 32
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
2007 · Xuehou Tan · Theoretical Computer Science · 22
SPU-PMD: Self-Supervised Point Cloud Upsampling via Progressive Mesh Deformation
2024 · Yanzhe Liu, Rong Chen, et al. · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · 21
Optimal Point Movement for Covering Circular Regions
2013 · Danny Z. Chen, Xuehou Tan, et al. · Algorithmica · 21
Sweeping simple polygons with the minimum number of chain guards
2006 · Xuehou Tan · Information Processing Letters · 18
Searching a Simple Polygon by a k-Searcher
2000 · Xuehou Tan · Lecture notes in computer science · 18
Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems
2017 · Xuehou Tan, Bo Jiang · Lecture notes in computer science · 15
A Characterization of Polygonal Regions Searchable from the Boundary
2005 · Xuehou Tan · Lecture notes in computer science · 15
Approximation Algorithms for Cutting Out Polygons with Lines and Rays
2005 · Xuehou Tan · Lecture notes in computer science · 14
On optimal bridges between two convex regions
2000 · Xuehou Tan · Information Processing Letters · 14
Computational Geometry, Graphs and Applications
2011 · Akiyama, Jin, Tan, Xuehou, et al. · Lecture notes in computer science · 13
A unified and efficient solution to the room search problem
2007 · Xuehou Tan · Computational Geometry · 13
PDF
Shortest safari routes in simple polygons
1994 · Xuehou Tan, Tomio Hirata · Lecture notes in computer science · 12
On the Capture Time of Cops and Robbers Game on a Planar Graph
2016 · Photchchara Pisantechakool, Xuehou Tan · Lecture notes in computer science · 11
Shortest zookeeper's routes in simple polygons
2001 · Xuehou Tan · Information Processing Letters · 11
The intersection searching problem for c-oriented polygons
1991 · Xue-Hou Tan, Tomio Hirata, et al. · Information Processing Letters · 11
An efficient algorithm for the three-guard problem
2008 · Xuehou Tan · Discrete Applied Mathematics · 8
The Two-Guard Problem Revisited and Its Generalization
2004 · Xuehou Tan · Lecture notes in computer science · 8
Works count: 111
Citation count: 825
H-index: 15
I10-index: 23
Year
Topic
Type