Xuehou Tan

Proceedings of the Theory and Applications of Models of Computation, 2024

SPU-PMD: Self-Supervised Point Cloud Upsampling via Progressive Mesh Deformation.

[BibT_eX]

[DOI]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024

Revisiting the Stretch Factor of Delaunay Triangulations of Points in Convex Position.

[BibT_eX]

[DOI]

Rong Chen

Qing Jiang

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Improved stretch factor of Delaunay triangulations of points in convex position.

[BibT_eX]

[DOI]

Charatsanyakul Sakthip

Shimao Liu

J. Comb. Optim., 2023

2022

Improved exploration of unknown polygons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

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

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters.

[BibT_eX]

[DOI]

Rong Chen

Proceedings of the Theory and Applications of Models of Computation, 2022

2021

The touring rays and related problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

The simple grid polygon exploration problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

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

[BibT_eX]

[DOI]

Comput. Geom., 2021

2020

Polynomial-Time Algorithms for the Touring Rays and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Walking an Unknown Street with Limited Sensing.

[BibT_eX]

[DOI]

Yonggong Ren

Int. J. Pattern Recognit. Artif. Intell., 2019

Characterizing Link-2 LR-Visibility Polygons and Related Problems.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Computing simple paths from given points inside a polygon.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position.

[BibT_eX]

[DOI]

Charatsanyakul Sakthip

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

The capture time of a planar graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

An improved algorithm for computing a shortest watchman route for lines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

The Touring Polygons Problem Revisited.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2017

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

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

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

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

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

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Evacuating from an Unknown Affected Area.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 2016

Competitive Strategies for Evacuating from an Unknown Affected Area.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2016

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

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Optimal Point Movement for Covering Circular Regions.

[BibT_eX]

[DOI]

Algorithmica, 2015

A New Distributed Algorithm for Computing a Dominating Set on Grids.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

An Improved On-line Strategy for Exploring Unknown Polygons.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Optimum sweeps of simple polygons with two guards.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Characterizing and recognizing LR-visibility polygons.

[BibT_eX]

[DOI]

Jing Zhang

Discret. Appl. Math., 2014

Finding Simple Paths on Given Points in a Polygonal Region.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

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

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Approximation algorithms for cutting a convex polyhedron out of a sphere.

[BibT_eX]

[DOI]

Gangshan Wu

Theor. Comput. Sci., 2013

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

[BibT_eX]

[DOI]

Jing Zhang

Proceedings of the Discrete and Computational Geometry and Graphs, 2013

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

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2013

2011

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

New Algorithms for Barrier Coverage with Mobile Sensors.

[BibT_eX]

[DOI]

Gangshan Wu

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Simple Characterization of LR-visibility Polygons.

[BibT_eX]

[DOI]

Jing Zhang

Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009

Searching a Circular Corridor with Two Flashlights.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008

Searching a Polygonal Region by Two Guards.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2008

An efficient algorithm for the three-guard problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

A unified and efficient solution to the room search problem.

[BibT_eX]

[DOI]

Comput. Geom., 2008

2007

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Sweeping simple polygons with the minimum number of chain guards.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Searching a Polygonal Region by Two Guards.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

A 2-approximation algorithm for the zookeeper's problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Editorial.

[BibT_eX]

[DOI]

Jin Akiyama

Mikio Kano

Comput. Geom., 2006

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

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Approximation Algorithms for Cutting Out Polygons with Lines and Rays.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Approximation algorithms for the watchman route and zookeeper's problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

An Optimal Algorithm for the 1-Searchability of Polygonal Rooms.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

The Two-Guard Problem Revisited and Its Generalization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Finding shortest safari routes in simple polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

A Characterization of Polygonal Regions Searchable from the Boundary.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002

Finding an Optimal Bridge Between Two Polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2002

2001

Optimal computation of the Voronoi diagram of disjoint clusters.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Fast computation of shortest watchman routes in simple polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Shortest zookeeper's routes in simple polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

2000

On optimal bridges between two convex regions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Efficient Algorithms for Searching a Polygonal Room with a Door.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Searching a Simple Polygon by a <i>k</i>-Searcher.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

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

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

Edge Guards in Straight Walkable Polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

Routing Multiterminal Nets on a Hexagonal Grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

An Efficient Solution to the Corridor Search Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

1997

Hexagonal Routings of Multiterminal Nets.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Two-Guarding a Rectilinear Polygon.

[BibT_eX]

[DOI]

Binhai Zhu

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Hexagonal Three-Layer Channel Routing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

1994

An optimal channel-routing algorithm in the times square model.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

Complexity of Projected Images of Convex Subdivisions.

[BibT_eX]

[DOI]

Comput. Geom., 1994

Shortest Safari Routes in Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

An incremental algorithm for constructing shortest watchman routes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1993

Constructing Shortest Watchman Routes by Divide-and-Conquer.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1991

The Intersection Searching Problem for c-Oriented Polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1990

Spatial Point Location and Its Applications.

[BibT_eX]

[DOI]