260 results on '"Tan, Xuehou"'
Search Results
2. An Optimal and Practical Algorithm for the Planar 2-Center Problem
3. Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters
4. Improved stretch factor of Delaunay triangulations of points in convex position
5. Polynomial-Time Algorithms for the Touring Rays and Related Problems
6. On the upper bound on the average distance from the Fermat-Weber center of a convex body
7. The simple grid polygon exploration problem
8. Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position
9. Computing simple paths from given points inside a polygon
10. Optimal Point Movement for Covering Circular Regions
11. Polynomial-Time Algorithms for the Touring Rays and Related Problems
12. Simple Algorithms for the Planar 2-Center Problem
13. Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems
14. On the Conjecture of the Smallest 3-Cop-Win Planar Graph
15. The capture time of a planar graph
16. On the Capture Time of Cops and Robbers Game on a Planar Graph
17. Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position
18. An Improved On-line Strategy for Exploring Unknown Polygons
19. A New Distributed Algorithm for Computing a Dominating Set on Grids
20. An On-Line Strategy of Groups Evacuation from a Convex Region in the Plane
21. Simple Characterization of LR-visibility Polygons
22. A Characterization of Link-2 LR-visibility Polygons with Applications
23. On-Line Strategies for Evacuating from a Convex Region in the Plane
24. Finding Simple Paths on Given Points in a Polygonal Region
25. An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
26. Improved stretch factor of Delaunay triangulations of points in convex position
27. A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body
28. Optimal Point Movement for Covering Circular Regions
29. Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region
30. Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere
31. New Algorithms for Barrier Coverage with Mobile Sensors
32. Optimum Sweeps of Simple Polygons with Two Guards
33. Minimization of the maximum distance between the two guards patrolling a polygonal region
34. Characterizing and recognizing LR-visibility polygons
35. Searching a Circular Corridor with Two Flashlights
36. Simple $$O(n~log^{2}~n)$$ Algorithms for the Planar 2-Center Problem
37. Searching a Polygonal Region by Two Guards
38. Linear-Time 2-Approximation Algorithm for the Watchman Route Problem
39. Approximation Algorithms for Cutting Out Polygons with Lines and Rays
40. The Two-Guard Problem Revisited and Its Generalization
41. A Characterization of Polygonal Regions Searchable from the Boundary
42. Improved exploration of unknown polygons
43. Approximation algorithms for cutting a convex polyhedron out of a sphere
44. Efficient Algorithms for Searching a Polygonal Room with a Door
45. Approximation Algorithms for the Watchman Route and Zookeeper’s Problems
46. Finding an Optimal Bridge between Two Polygons
47. An Efficient Solution to the Corridor Search Problem
48. Searching a Simple Polygon by a k-Searcher
49. Optimal Point Movement for Covering Circular Regions
50. On the Capture Time of Cops and Robbers Game on a Planar Graph
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.