default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXuehou Tan
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c40]Xuehou Tan, Rong Chen, Qing Jiang:
Revisiting the Stretch Factor of Delaunay Triangulations of Points in Convex Position. AAIM (1) 2024: 263-273- [c39]Yanzhe Liu, Rong Chen, Yushi Li, Yixi Li, Xuehou Tan:
SPU-PMD: Self-Supervised Point Cloud Upsampling via Progressive Mesh Deformation. CVPR 2024: 5188-5197 - [c38]Xuehou Tan:
An Optimal and Practical Algorithm for the Planar 2-Center Problem. TAMC 2024: 63-74 - 2023
- [j42]Xuehou Tan
, Charatsanyakul Sakthip, Bo Jiang, Shimao Liu:
Improved stretch factor of Delaunay triangulations of points in convex position. J. Comb. Optim. 45(1): 3 (2023) - 2022
- [j41]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. 105-A(5): 853-857 (2022) - [j40]Xuehou Tan, Qi Wei:
Improved exploration of unknown polygons. Theor. Comput. Sci. 922: 424-437 (2022) - [c37]Xuehou Tan, Rong Chen:
Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters. TAMC 2022: 128-139 - 2021
- [j39]Xuehou Tan, Bo Jiang:
On the upper bound on the average distance from the Fermat-Weber center of a convex body. Comput. Geom. 97: 101769 (2021) - [j38]Qi Wei, Jie Sun, Xuehou Tan, Xiaolin Yao, Yonggong Ren:
The simple grid polygon exploration problem. J. Comb. Optim. 41(3): 625-639 (2021) - [j37]Xuehou Tan:
The touring rays and related problems. Theor. Comput. Sci. 866: 43-55 (2021) - 2020
- [c36]Xuehou Tan:
Polynomial-Time Algorithms for the Touring Rays and Related Problems. AAIM 2020: 1-12
2010 – 2019
- 2019
- [j36]Xuehou Tan, Bo Jiang:
Computing simple paths from given points inside a polygon. Discret. Appl. Math. 252: 67-76 (2019) - [j35]Xuehou Tan, Bo Jiang:
Characterizing Link-2 LR-Visibility Polygons and Related Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(2): 423-429 (2019) - [j34]Qi Wei, Xuehou Tan, Yonggong Ren:
Walking an Unknown Street with Limited Sensing. Int. J. Pattern Recognit. Artif. Intell. 33(13): 1959042:1-1959042:14 (2019) - [c35]Xuehou Tan, Charatsanyakul Sakthip, Bo Jiang:
Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position. COCOA 2019: 473-484 - 2018
- [j33]Xuehou Tan, Bo Jiang:
The Touring Polygons Problem Revisited. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(5): 772-777 (2018) - [j32]Xuehou Tan, Bo Jiang:
An improved algorithm for computing a shortest watchman route for lines. Inf. Process. Lett. 131: 51-54 (2018) - [j31]Photchchara Pisantechakool, Xuehou Tan:
The capture time of a planar graph. J. Comb. Optim. 36(4): 1103-1117 (2018) - 2017
- [c34]Xuehou Tan, Bo Jiang:
Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem. COCOON 2017: 481-491 - [c33]Photchchara Pisantechakool, Xuehou Tan:
On the Conjecture of the Smallest 3-Cop-Win Planar Graph. TAMC 2017: 499-514 - [c32]Xuehou Tan, Bo Jiang:
Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems. TAMC 2017: 614-627 - 2016
- [j30]Qi Wei, Xuehou Tan, Bo Jiang:
Competitive Strategies for Evacuating from an Unknown Affected Area. IEICE Trans. Inf. Syst. 99-D(10): 2585-2590 (2016) - [j29]Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang:
Evacuating from an Unknown Affected Area. Int. J. Pattern Recognit. Artif. Intell. 30(7): 1659022:1-1659022:16 (2016) - [c31]Photchchara Pisantechakool, Xuehou Tan:
On the Capture Time of Cops and Robbers Game on a Planar Graph. COCOA 2016: 3-17 - 2015
- [j28]Danny Ziyi Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
Optimal Point Movement for Covering Circular Regions. Algorithmica 72(2): 379-399 (2015) - [c30]Xuehou Tan, Qi Wei:
An Improved On-line Strategy for Exploring Unknown Polygons. COCOA 2015: 163-177 - [c29]Photchchara Pisantechakool, Xuehou Tan:
A New Distributed Algorithm for Computing a Dominating Set on Grids. FAW 2015: 217-228 - 2014
- [j27]Xuehou Tan, Bo Jiang, Jing Zhang:
Characterizing and recognizing LR-visibility polygons. Discret. Appl. Math. 165: 303-311 (2014) - [j26]Xuehou Tan, Bo Jiang:
Optimum sweeps of simple polygons with two guards. Inf. Process. Lett. 114(3): 130-136 (2014) - [j25]Xuehou Tan, Bo Jiang:
Minimization of the maximum distance between the two guards patrolling a polygonal region. Theor. Comput. Sci. 532: 73-79 (2014) - [c28]Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang:
On-Line Strategies for Evacuating from a Convex Region in the Plane. COCOA 2014: 74-85 - [c27]Xuehou Tan, Bo Jiang:
Finding Simple Paths on Given Points in a Polygonal Region. FAW 2014: 229-239 - 2013
- [j24]Xuehou Tan, Gangshan Wu:
Approximation algorithms for cutting a convex polyhedron out of a sphere. Theor. Comput. Sci. 508: 66-73 (2013) - [c26]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: 250-259 - [c25]Xuehou Tan, Jing Zhang, Bo Jiang:
A Characterization of Link-2 LR-visibility Polygons with Applications. JCDCGG 2013: 161-172 - [e3]Michael R. Fellows, Xuehou Tan, Binhai Zhu:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings. Lecture Notes in Computer Science 7924, Springer 2013, ISBN 978-3-642-38755-5 [contents] - 2012
- [c24]Xuehou Tan, Bo Jiang:
Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region. FAW-AAIM 2012: 47-57 - [c23]Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
Optimal Point Movement for Covering Circular Regions. ISAAC 2012: 332-341 - 2011
- [j23]Bo Jiang, Xuehou Tan:
Searching for mobile intruders in circular corridors by two 1-searchers. Discret. Appl. Math. 159(16): 1793-1805 (2011) - [c22]Xuehou Tan, Gangshan Wu:
Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere. FAW-AAIM 2011: 125-135 - [e2]Jin Akiyama, Bo Jiang, Mikio Kano, Xuehou Tan:
Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers. Lecture Notes in Computer Science 7033, Springer 2011, ISBN 978-3-642-24982-2 [contents] - [i1]Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
Optimal Point Movement for Covering Circular Regions. CoRR abs/1107.1012 (2011) - 2010
- [c21]Xuehou Tan, Jing Zhang, Bo Jiang:
Simple Characterization of LR-visibility Polygons. CGGA 2010: 176-187 - [c20]Xuehou Tan, Bo Jiang:
Optimum Sweeps of Simple Polygons with Two Guards. FAW 2010: 304-315 - [c19]Xuehou Tan, Gangshan Wu:
New Algorithms for Barrier Coverage with Mobile Sensors. FAW 2010: 327-338
2000 – 2009
- 2009
- [c18]Bo Jiang, Xuehou Tan:
Searching a Circular Corridor with Two Flashlights. TAMC 2009: 345-359 - 2008
- [j22]Xuehou Tan:
A unified and efficient solution to the room search problem. Comput. Geom. 40(1): 45-60 (2008) - [j21]Xuehou Tan:
An efficient algorithm for the three-guard problem. Discret. Appl. Math. 156(17): 3312-3324 (2008) - [j20]Xuehou Tan, Bo Jiang:
Searching a Polygonal Region by Two Guards. J. Comput. Sci. Technol. 23(5): 728-739 (2008) - 2007
- [j19]Xuehou Tan:
Sweeping simple polygons with the minimum number of chain guards. Inf. Process. Lett. 102(2-3): 66-71 (2007) - [j18]Xuehou Tan:
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. Theor. Comput. Sci. 384(1): 92-103 (2007) - [c17]Xuehou Tan:
Searching a Polygonal Region by Two Guards. TAMC 2007: 262-273 - 2006
- [j17]Jin Akiyama, Mikio Kano, Xuehou Tan:
Editorial. Comput. Geom. 34(1): 1 (2006) - [j16]Xuehou Tan:
A 2-approximation algorithm for the zookeeper's problem. Inf. Process. Lett. 100(5): 183-187 (2006) - [c16]Xuehou Tan:
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. TAMC 2006: 181-191 - 2005
- [c15]Xuehou Tan:
Approximation Algorithms for Cutting Out Polygons with Lines and Rays. COCOON 2005: 534-543 - [e1]Jin Akiyama, Mikio Kano, Xuehou Tan:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3742, Springer 2005, ISBN 3-540-30467-3 [contents] - 2004
- [j15]Xuehou Tan:
Approximation algorithms for the watchman route and zookeeper's problems. Discret. Appl. Math. 136(2-3): 363-376 (2004) - [c14]Xuehou Tan:
The Two-Guard Problem Revisited and Its Generalization. ISAAC 2004: 847-858 - [c13]Xuehou Tan:
An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. JCDCG 2004: 174-183 - 2003
- [j14]Xuehou Tan, Tomio Hirata:
Finding shortest safari routes in simple polygons. Inf. Process. Lett. 87(4): 179-186 (2003) - [c12]Xuehou Tan:
A Characterization of Polygonal Regions Searchable from the Boundary. IJCCGGT 2003: 200-215 - 2002
- [j13]Xuehou Tan:
Finding an Optimal Bridge Between Two Polygons. Int. J. Comput. Geom. Appl. 12(3): 249-262 (2002) - 2001
- [j12]Xuehou Tan:
Shortest zookeeper's routes in simple polygons. Inf. Process. Lett. 77(1): 23-26 (2001) - [j11]Xuehou Tan:
Fast computation of shortest watchman routes in simple polygons. Inf. Process. Lett. 77(1): 27-33 (2001) - [j10]Xuehou Tan:
Optimal computation of the Voronoi diagram of disjoint clusters. Inf. Process. Lett. 79(3): 115-119 (2001) - [c11]Xuehou Tan:
Finding an Optimal Bridge between Two Polygons. COCOON 2001: 170-180 - [c10]Xuehou Tan:
Approximation Algorithms for the Watchman Route and Zookeeper's Problems. COCOON 2001: 201-206 - 2000
- [j9]Xuehou Tan:
On optimal bridges between two convex regions. Inf. Process. Lett. 76(4-6): 163-168 (2000) - [c9]Xuehou Tan:
Searching a Simple Polygon by a k-Searcher. ISAAC 2000: 503-514 - [c8]Xuehou Tan:
Efficient Algorithms for Searching a Polygonal Room with a Door. JCDCG 2000: 339-350
1990 – 1999
- 1999
- [j8]Xuehou Tan, Xiaoyu Song:
Routing Multiterminal Nets on a Hexagonal Grid. Discret. Appl. Math. 90(1-3): 245-255 (1999) - [j7]Xuehou Tan:
Edge Guards in Straight Walkable Polygons. Int. J. Comput. Geom. Appl. 9(1): 63-80 (1999) - [j6]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes". Int. J. Comput. Geom. Appl. 9(3): 319-323 (1999) - 1998
- [c7]Xuehou Tan:
An Efficient Solution to the Corridor Search Problem. JCDCG 1998: 317-331 - 1997
- [c6]Xuehou Tan, Xiaoyu Song:
Hexagonal Routings of Multiterminal Nets. COCOON 1997: 311-320 - 1996
- [c5]Xuehou Tan, Binhai Zhu:
Two-Guarding a Rectilinear Polygon. COCOON 1996: 391-400 - 1995
- [j5]Xuehou Tan, Xiaoyu Song:
Hexagonal Three-Layer Channel Routing. Inf. Process. Lett. 55(4): 223-228 (1995) - 1994
- [j4]Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama:
Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4: 293-308 (1994) - [j3]Xiaoyu Song, Xuehou Tan:
An optimal channel-routing algorithm in the times square model. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(7): 891-898 (1994) - [c4]Xuehou Tan, Tomio Hirata:
Shortest Safari Routes in Simple Polygon. ISAAC 1994: 523-531 - 1993
- [j2]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
An incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geom. Appl. 3(4): 351-365 (1993) - [c3]Xuehou Tan, Tomio Hirata:
Constructing Shortest Watchman Routes by Divide-and-Conquer. ISAAC 1993: 68-77 - 1991
- [j1]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
The Intersection Searching Problem for c-Oriented Polygons. Inf. Process. Lett. 37(4): 201-204 (1991) - [c2]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
An Incremental Algorithm for Constructing Shortest Watchman Routes. ISA 1991: 163-175 - 1990
- [c1]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
Spatial Point Location and Its Applications. SIGAL International Symposium on Algorithms 1990: 241-250
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
