Improved Algorithm for a Widest 1-Corner Corridor

Authors:
Gautam K. Das;Debapriyay Mukhopadhyay;Subhas C. Nandy
Affiliations:
TOR ANUMANA Technologies Private Limited, Kolkata, India 700020;Rebaca Technologies Private Limited, Kolkata, India 700 091;Indian Statistical Institute, Kolkata, India 700108
Venue:
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Year:
2009

Citing 8
Cited 0

The K-dense corridor problems

Pattern Recognition Letters
Widest empty L-shaped corridor

Information Processing Letters
The widest k-dense corridor problems

Information Processing Letters
Dynamically maintaining the widest k-dense corridor

Theoretical Computer Science
Widest-corridor problems

Nordic Journal of Computing
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set P of n points on a 2D plane, the 1-corner empty corridor is a region inside the convex hull of P which is bounded by a pair of links; each link is an unbounded trapezium bounded by two parallel half-lines, and it does not contain any point of P . We present an improved algorithm for computing the widest empty 1-corner corridor that runs in O (n 3log2 n ) time and O (n 2) space. This improves the time complexity of the best known algorithm for the same problem by a factor of $\frac{n}{\log n}$[4].