Dynamically Maintaining the Widest k -Dense Corridor

Authors:
Subhas C. Nandy;Tomohiro Harayama;Tetsuo Asano
Affiliations:
-;-;-
Venue:
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Year:
2000

Citing 5
Cited 0

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
The K-dense corridor problems

Pattern Recognition Letters
The widest k-dense corridor problems

Information Processing Letters
Widest-corridor problems

Nordic Journal of Computing
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an improved algorithm for dynamically maintaining the widest k-dense corridor as proposed in [6]. Our algorithm maintains a data structure of size O(n2), where n is the number of points present on the floor at the current instant of time. For each insertion/deletion of points, the data structure can be updated in O(n) time, and the widest k-dense corridor in the updated environment can be reported in O(kn + nlogn) time.