论文信息 - Lower bounds for the polygon exploration problem - 字舞流文

Lower bounds for the polygon exploration problem

We improve the best known lower bound for the polygon exploration problem from 1.2071 to 1.2825.

Elmar Langetepe | Christian Icking | Roland Hagius

[1] Tomio Hirata,et al. An incremental algorithm for constructing shortest watchman routes , 1993, Int. J. Comput. Geom. Appl..

[2] Bengt J. Nilsson,et al. Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms , 1997, FCT.

[3] Αθανασία Μπαλωμένου. Επιφάνεια και περίμετρος ισοδύναμων τριγώνων στο περιβάλλον Cabri - Geometry II , 2003 .

[4] Xiaotie Deng,et al. How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

[5] Tomio Hirata,et al. Constructing Shortest Watchman Routes by Divide-and-Conquer , 1993, ISAAC.

[6] Rolf Klein,et al. The Polygon Exploration Problem , 2001, SIAM J. Comput..

[7] XUEHOU TAN,et al. Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes" , 1999, Int. J. Comput. Geom. Appl..

[8] Wei-Pand Chin,et al. Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..