Dynamic Connectivity for Axis-Parallel Rectangles |
| |
Authors: | Peyman Afshani Timothy M. Chan |
| |
Affiliation: | (1) School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada |
| |
Abstract: | 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 and the query time (deciding whether two given rectangles are connected) is O(1). It slightly improves the update time (O(n 0.94)) of the previous method while drastically reducing the query time (near O(n 1/3)). In addition, our method does not use fast matrix multiplication results and supports a wider range of queries. This work has been supported by an NSERC grant. |
| |
Keywords: | Data structures Dynamic data structures Computational geometry Dynamic connectivity |
本文献已被 SpringerLink 等数据库收录! |