Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Widest empty L-shaped corridor
Information Processing Letters
Nordic Journal of Computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On finding an empty staircase polygon of largest area (width) in a planar point-set
Computational Geometry: Theory and Applications
Computing obnoxious 1-corner polygonal chains
Computers and Operations Research
On finding widest empty curved corridors
Computational Geometry: Theory and Applications
Improved algorithm for the widest empty 1-corner corridor
Information Processing Letters
| Hi-index | 0.89 |
A 1-corner corridor through a set S of points is an open subset of CH(S) containing no points from S and bounded by a pair of parallel polygonal lines each of which contains two segments. Given a set of n points in the plane, we consider the problem of computing a widest empty 1-corner corridor. We describe an algorithm that solves the problem in O(n4 log n) time and O(n) space. We also present an approximation algorithm that computes in O(n log n/ε 1/2 + n2/ε) time a solution with width at least a fraction (1 - ε) of the optimal, for any small enough ε 0.