Dynamic connectivity for axis-parallel rectangles

Peyman Afshani, Timothy M. Chan

Research output: Contribution to journalArticlepeer-review


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)=O(n 0.910) 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.

Original languageEnglish (US)
Pages (from-to)474-487
Number of pages14
JournalAlgorithmica (New York)
Issue number4
StatePublished - Apr 2009
Externally publishedYes


  • Computational geometry
  • Data structures
  • Dynamic connectivity
  • Dynamic data structures

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Dynamic connectivity for axis-parallel rectangles'. Together they form a unique fingerprint.

Cite this