论文信息 - Monotonicity of rectilinear geodesics in d-space (extended abstract)

Monotonicity of rectilinear geodesics in d-space (extended abstract)

Let B be any finite set of pairwise-disjoint, axes-parallel boxes in Euclidean &space. Our main theorem is that for any two points s, t not in the interior o;’ l?, there exists a coordinate direction @such that every rectilinear B-avoiding shortest path is monotone along@ The key concept in the proof is an appropriate notion of pyramids.

Chee-Keng Yap | Joonsoo Choi

[1] Emo WELZL,et al. Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[2] Chee-Keng Yap,et al. Rectilinear geodesics in 3-space (extended abstract) , 1995, SCG '95.

[3] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[4] Pinaki Mitra,et al. Orthogonal shortest route queries among axis parallel rectangular obstacles , 1994, Int. J. Comput. Geom. Appl..

[5] Mikhail J. Atallah,et al. Parallel rectilinear shortest paths with rectangular obstacles , 1990, SPAA '90.

[6] D. T. Lee,et al. Rectilinear shortest paths with rectangular barriers , 1985, SCG '85.

[7] Joseph S. B. Mitchell,et al. Minimum-link paths among obstacles in the plane , 1990, SCG '90.

[8] Joonsoo Choi. Geodesic problems in high dimensions , 1996 .

[9] Subhash Suri,et al. Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[10] Esther M. Arkin,et al. On monotone paths among obstacles with applications to planning assemblies , 1989, SCG '89.

[11] D. T. Lee,et al. Rectilinear shortest paths in the presence of rectangular barriers , 1989, Discret. Comput. Geom..

[12] Chee Yap,et al. Rectilinear geodesics in 3-space , 1995 .

[13] Mikhail J. Atallah,et al. Parallel Rectilinear Shortest Paths with Rectangular Obstacles , 1991, Comput. Geom..