论文信息 - Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon - 字舞流文

Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon

D. T. Lee | Muhammad H. Alsuwaiyel | Der-Tsai Lee | M. H. Alsuwaiyel

[1] Kazuo Nakajima,et al. An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph , 1988, SIAM J. Comput..

[2] John Hershberger,et al. Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[3] Majid Sarrafzadeh,et al. Minimum Cuts for Circular-Arc Graphs , 1990, SIAM J. Comput..

[4] S. Suri. A linear time algorithm with minimum link paths inside a simple polygon , 1986 .

[5] D. T. Lee,et al. Minimal Link Visibility Paths Inside a Simple Polygon , 1993, Comput. Geom..

[6] Giri Narasimhan,et al. LR-visibility in Polygons , 1997, Comput. Geom..

[7] Han Hoogeveen,et al. Analysis of Christofides' heuristic: Some paths are more difficult than cycles , 1991, Oper. Res. Lett..

[8] Subir Kumar Ghosh. Computing the Visibility Polygon from a Convex Set and Related Problems , 1991, J. Algorithms.

[9] Giri Narasimhan,et al. Optimal linear-time algorithm for the shortest illuminating line segment in a polygon , 1994, SCG '94.