Widest Empty Corridor with Multiple Links and Right-angle Turns

We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corridor problem studied in 2, 3] and it relates to the problem of computing corridors of other shapes posed in 1, 3]. We propose two alternative de nitions of a corridor with at most ` links and right-angle turns and one is more restrictive than the other. When ` = 2, it becomes the widest empty L-shaped corridor problem posed in 3], for which we develop an O(n3)-time algorithm. For general `, we present a dynamic programming algorithm and prove a bound of O(`n8) on its running time for the more restrictive de nition. The running time increases by a factor of n for the other one. We also develop a faster approximation algorithm that computes a solution with width at least (1 ; ) times the optimal for any > 0. The approximation algorithm runs in O((1= )`n3 log5 n) time for the more restrictive de nition and the ...

• Type: Conference
• Year: 1994
• Where: CCCG
• Authors: Siu-Wing Cheng
• Keywords: CCCG 1994, CCCG 2007, Corridor Problem, Empty Corridor Problem, Right-angle Turns