A (4n − 4)-Bit Representation of a Rectangular Drawing or Floorplan

  • Toshihiko Takahashi
  • Ryo Fujimaki
  • Youhei Inoue
Conference paper

DOI: 10.1007/978-3-642-02882-3_6

Volume 5609 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Takahashi T., Fujimaki R., Inoue Y. (2009) A (4n − 4)-Bit Representation of a Rectangular Drawing or Floorplan. In: Ngo H.Q. (eds) Computing and Combinatorics. COCOON 2009. Lecture Notes in Computer Science, vol 5609. Springer, Berlin, Heidelberg

Abstract

A subdivision of a rectangle into rectangular faces with horizontal and vertical line segments is called a rectangular drawing or floorplan. Yamanaka and Nakano published a (5n − 5)-bit representation of a rectangular drawing, where n is the number of inner rectangles. In this paper, a (4n − 4)-bit representation of rectangular drawing is introduced. Moreover, this representation gives an alternative proof that the number of rectangles with n rectangles R(n) ≤ 13.5n − 1.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Toshihiko Takahashi
    • 1
  • Ryo Fujimaki
    • 1
  • Youhei Inoue
    • 2
  1. 1.Niigata UniversityNiigataJapan
  2. 2.Renesas Technology Corp.TokyoJapan