Xuehou Tan - RankMe

90 papers A* 1B 5C 14Misc 10Journal 46Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	A Space-Partition Based Approach to the 2-Center Problem in Three and Higher Dimensions. TAMC Xuehou Tan, Rong Chen
2025	J	`jnl`	An Optimal and Practical Algorithm for the Planar 2-center Problem. Theory Comput. Syst. Xuehou Tan
2025	J	`jnl`	Largest convex hulls for convex-hull disjoint clusters with bounded size. Theor. Comput. Sci. Xuehou Tan, Rong Chen
2025	J	`jnl`	On-line exploration of an unbounded region with one obstacle. Theor. Comput. Sci. Qi Wei, Xuehou Tan, Haonan Wu, Xiaolin Yao, Yonggong Ren
2024	C	`conf`	An Optimal and Practical Algorithm for the Planar 2-Center Problem. TAMC Xuehou Tan
2024	—	`conf`	Revisiting the Stretch Factor of Delaunay Triangulations of Points in Convex Position. AAIM (1) Xuehou Tan, Rong Chen, Qing Jiang
2024	A*	`conf`	SPU-PMD: Self-Supervised Point Cloud Upsampling via Progressive Mesh Deformation. CVPR Yanzhe Liu, Rong Chen, Yushi Li, Yixi Li, Xuehou Tan
2023	J	`jnl`	Improved stretch factor of Delaunay triangulations of points in convex position. J. Comb. Optim. Xuehou Tan, Charatsanyakul Sakthip, Bo Jiang, Shimao Liu
2022	J	`jnl`	Improved exploration of unknown polygons. Theor. Comput. Sci. Xuehou Tan, Qi Wei
2022	C	`conf`	Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters. TAMC Xuehou Tan, Rong Chen
2022	J	`jnl`	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. Xuehou Tan
2021	J	`jnl`	On the upper bound on the average distance from the Fermat-Weber center of a convex body. Comput. Geom. Xuehou Tan, Bo Jiang
2021	J	`jnl`	The simple grid polygon exploration problem. J. Comb. Optim. Qi Wei, Jie Sun, Xuehou Tan, Xiaolin Yao, Yonggong Ren
2021	J	`jnl`	The touring rays and related problems. Theor. Comput. Sci. Xuehou Tan
2020	C	`conf`	Polynomial-Time Algorithms for the Touring Rays and Related Problems. AAIM Xuehou Tan
2019	J	`jnl`	Characterizing Link-2 LR-Visibility Polygons and Related Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Xuehou Tan, Bo Jiang
2019	J	`jnl`	Computing simple paths from given points inside a polygon. Discret. Appl. Math. Xuehou Tan, Bo Jiang
2019	C	`conf`	Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position. COCOA Xuehou Tan, Charatsanyakul Sakthip, Bo Jiang
2019	J	`jnl`	Walking an Unknown Street with Limited Sensing. Int. J. Pattern Recognit. Artif. Intell. Qi Wei, Xuehou Tan, Yonggong Ren
2018	J	`jnl`	An improved algorithm for computing a shortest watchman route for lines. Inf. Process. Lett. Xuehou Tan, Bo Jiang
2018	J	`jnl`	The Touring Polygons Problem Revisited. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Xuehou Tan, Bo Jiang
2018	J	`jnl`	The capture time of a planar graph. J. Comb. Optim. Photchchara Pisantechakool, Xuehou Tan
2017	C	`conf`	Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems. TAMC Xuehou Tan, Bo Jiang
2017	C	`conf`	On the Conjecture of the Smallest 3-Cop-Win Planar Graph. TAMC Photchchara Pisantechakool, Xuehou Tan
2017	Misc	`conf`	Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem. COCOON Xuehou Tan, Bo Jiang
2016	J	`jnl`	Competitive Strategies for Evacuating from an Unknown Affected Area. IEICE Trans. Inf. Syst. Qi Wei, Xuehou Tan, Bo Jiang
2016	J	`jnl`	Evacuating from an Unknown Affected Area. Int. J. Pattern Recognit. Artif. Intell. Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang
2016	C	`conf`	On the Capture Time of Cops and Robbers Game on a Planar Graph. COCOA Photchchara Pisantechakool, Xuehou Tan
2015	Misc	`conf`	A New Distributed Algorithm for Computing a Dominating Set on Grids. FAW Photchchara Pisantechakool, Xuehou Tan
2015	C	`conf`	An Improved On-line Strategy for Exploring Unknown Polygons. COCOA Xuehou Tan, Qi Wei
2015	J	`jnl`	Optimal Point Movement for Covering Circular Regions. Algorithmica Danny Ziyi Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
2014	J	`jnl`	Characterizing and recognizing LR-visibility polygons. Discret. Appl. Math. Xuehou Tan, Bo Jiang, Jing Zhang
2014	Misc	`conf`	Finding Simple Paths on Given Points in a Polygonal Region. FAW Xuehou Tan, Bo Jiang
2014	J	`jnl`	Minimization of the maximum distance between the two guards patrolling a polygonal region. Theor. Comput. Sci. Xuehou Tan, Bo Jiang
2014	C	`conf`	On-Line Strategies for Evacuating from a Convex Region in the Plane. COCOA Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang
2014	J	`jnl`	Optimum sweeps of simple polygons with two guards. Inf. Process. Lett. Xuehou Tan, Bo Jiang
2013	—	`conf`	A Characterization of Link-2 LR-visibility Polygons with Applications. JCDCGG Xuehou Tan, Jing Zhang, Bo Jiang
2013	C	`conf`	A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body. COCOA Xuehou Tan, Bo Jiang
2013	J	`jnl`	Approximation algorithms for cutting a convex polyhedron out of a sphere. Theor. Comput. Sci. Xuehou Tan, Gangshan Wu
2013	—	`ed.`	Frontiers in Algorithmics FAW-AAIM Michael R. Fellows, Xuehou Tan, Binhai Zhu
2012	—	`conf`	Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region. FAW-AAIM Xuehou Tan, Bo Jiang
2012	B	`conf`	Optimal Point Movement for Covering Circular Regions. ISAAC Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
2011	—	`conf`	Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere. FAW-AAIM Xuehou Tan, Gangshan Wu
2011	—	`ed.`	Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers CGGA Jin Akiyama, Bo Jiang, Mikio Kano, Xuehou Tan
2011	J	`jnl`	Optimal Point Movement for Covering Circular Regions CoRR Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
2011	J	`jnl`	Searching for mobile intruders in circular corridors by two 1-searchers. Discret. Appl. Math. Bo Jiang, Xuehou Tan
2010	Misc	`conf`	New Algorithms for Barrier Coverage with Mobile Sensors. FAW Xuehou Tan, Gangshan Wu
2010	Misc	`conf`	Optimum Sweeps of Simple Polygons with Two Guards. FAW Xuehou Tan, Bo Jiang
2010	—	`conf`	Simple Characterization of LR-visibility Polygons. CGGA Xuehou Tan, Jing Zhang, Bo Jiang
2009	C	`conf`	Searching a Circular Corridor with Two Flashlights. TAMC Bo Jiang, Xuehou Tan
2008	J	`jnl`	A unified and efficient solution to the room search problem. Comput. Geom. Xuehou Tan
2008	J	`jnl`	An efficient algorithm for the three-guard problem. Discret. Appl. Math. Xuehou Tan
2008	J	`jnl`	Searching a Polygonal Region by Two Guards. J. Comput. Sci. Technol. Xuehou Tan, Bo Jiang
2007	J	`jnl`	A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. Theor. Comput. Sci. Xuehou Tan
2007	C	`conf`	Searching a Polygonal Region by Two Guards. TAMC Xuehou Tan
2007	J	`jnl`	Sweeping simple polygons with the minimum number of chain guards. Inf. Process. Lett. Xuehou Tan
2006	J	`jnl`	A 2-approximation algorithm for the zookeeper's problem. Inf. Process. Lett. Xuehou Tan
2006	J	`jnl`	Editorial. Comput. Geom. Jin Akiyama, Mikio Kano, Xuehou Tan
2006	C	`conf`	Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. TAMC Xuehou Tan
2005	Misc	`conf`	Approximation Algorithms for Cutting Out Polygons with Lines and Rays. COCOON Xuehou Tan
2005	—	`ed.`	Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers JCDCG Jin Akiyama, Mikio Kano, Xuehou Tan
2004	—	`conf`	An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. JCDCG Xuehou Tan
2004	J	`jnl`	Approximation algorithms for the watchman route and zookeeper's problems. Discret. Appl. Math. Xuehou Tan
2004	B	`conf`	The Two-Guard Problem Revisited and Its Generalization. ISAAC Xuehou Tan
2003	—	`conf`	A Characterization of Polygonal Regions Searchable from the Boundary. IJCCGGT Xuehou Tan
2003	J	`jnl`	Finding shortest safari routes in simple polygons. Inf. Process. Lett. Xuehou Tan, Tomio Hirata
2002	J	`jnl`	Finding an Optimal Bridge Between Two Polygons. Int. J. Comput. Geom. Appl. Xuehou Tan
2001	Misc	`conf`	Approximation Algorithms for the Watchman Route and Zookeeper's Problems. COCOON Xuehou Tan
2001	J	`jnl`	Fast computation of shortest watchman routes in simple polygons. Inf. Process. Lett. Xuehou Tan
2001	Misc	`conf`	Finding an Optimal Bridge between Two Polygons. COCOON Xuehou Tan
2001	J	`jnl`	Optimal computation of the Voronoi diagram of disjoint clusters. Inf. Process. Lett. Xuehou Tan
2001	J	`jnl`	Shortest zookeeper's routes in simple polygons. Inf. Process. Lett. Xuehou Tan
2000	—	`conf`	Efficient Algorithms for Searching a Polygonal Room with a Door. JCDCG Xuehou Tan
2000	J	`jnl`	On optimal bridges between two convex regions. Inf. Process. Lett. Xuehou Tan
2000	B	`conf`	Searching a Simple Polygon by a ISAAC Xuehou Tan
1999	J	`jnl`	Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes". Int. J. Comput. Geom. Appl. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
1999	J	`jnl`	Edge Guards in Straight Walkable Polygons. Int. J. Comput. Geom. Appl. Xuehou Tan
1999	J	`jnl`	Routing Multiterminal Nets on a Hexagonal Grid. Discret. Appl. Math. Xuehou Tan, Xiaoyu Song
1998	—	`conf`	An Efficient Solution to the Corridor Search Problem. JCDCG Xuehou Tan
1997	Misc	`conf`	Hexagonal Routings of Multiterminal Nets. COCOON Xuehou Tan, Xiaoyu Song
1996	Misc	`conf`	Two-Guarding a Rectilinear Polygon. COCOON Xuehou Tan, Binhai Zhu
1995	J	`jnl`	Hexagonal Three-Layer Channel Routing. Inf. Process. Lett. Xuehou Tan, Xiaoyu Song
1994	J	`jnl`	An optimal channel-routing algorithm in the times square model. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Xiaoyu Song, Xuehou Tan
1994	J	`jnl`	Complexity of Projected Images of Convex Subdivisions. Comput. Geom. Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama
1994	B	`conf`	Shortest Safari Routes in Simple Polygon. ISAAC Xuehou Tan, Tomio Hirata
1993	J	`jnl`	An incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geom. Appl. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
1993	B	`conf`	Constructing Shortest Watchman Routes by Divide-and-Conquer. ISAAC Xuehou Tan, Tomio Hirata
1991	—	`conf`	An Incremental Algorithm for Constructing Shortest Watchman Routes. ISA Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
1991	J	`jnl`	The Intersection Searching Problem for c-Oriented Polygons. Inf. Process. Lett. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
1990	—	`conf`	Spatial Point Location and Its Applications. SIGAL International Symposium on Algorithms Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki