Dynamic algorithm for placing rectangles without overlapping

Takeshi Tokuyama, Takao Asano, Shuji Tsukiyama

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

We consider the dynamic allocation problem of rectangles such that mixed sequence of insertions and deletions of rectangles in a rectangular board is executed without any pair of rectangles overlapping each other. We present an O(n log log n) time algorithm for insertion of a rectangle if n rectangles have been already placed in the board. We solve the problem by reducing it to the contour construction problem on a special class of arrangements of rectangles.

Original languageEnglish
Pages (from-to)30-35
Number of pages6
JournalJournal of information processing
Volume14
Issue number1
Publication statusPublished - 1991 Jan 1

ASJC Scopus subject areas

  • Computer Science(all)

Cite this