Computational geometry: an introduction
Computational geometry: an introduction
Widest empty L-shaped corridor
Information Processing Letters
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Finding the largest area axis-parallel rectangle in a polygon
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
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 a widest empty 1-corner corridor
Information Processing Letters
Improved algorithm for the widest empty 1-corner corridor
Information Processing Letters
Locating an Obnoxious Line among Planar Objects
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
An α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain C such that α is the interior angle of C. Given a set P of n points in the plane and a fixed angle α, we want to compute the widest empty α-siphon that splits P into two non-empty sets. We present an efficient O(nlog3n)-time algorithm for computing the widest oriented α-siphon through P such that the orientation of a half-line of C is known. We also propose an O(n3log2n)-time algorithm for the widest arbitrarily-oriented version and an Θ(nlogn)-time algorithm for the widest arbitrarily-oriented α-siphon anchored at a given point.