In this paper we give a fully dynamic data structure to maintain the connectivity of the intersection graph of n axis-parallel rectangles. The amortized update time (insertion and deletion of rectangles) is O(n 10/11 polylog n) and the query time (deciding whether two given rectangles are connected) is O(1). It slightly improves the update time (O(n0.94)) of the previous method while drastically reducing the query time (near O(n1/3)). Our method does not use fast matrix multiplication results and supports a wider range of queries. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Afshani, P., & Chan, T. M. (2006). Dynamic connectivity for axis-parallel rectangles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4168 LNCS, pp. 16–27). Springer Verlag. https://doi.org/10.1007/11841036_5
Mendeley helps you to discover research relevant for your work.