Dynamically maintaining the widest k-dense corridor

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.