Skip to main content

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

  • Conference paper
Computing and Combinatorics (COCOON 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5609))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yao, B., Chen, H., Cheng, C.K., Graham, R.: Floorplan Representations: Complexity and Connections. ACM Trans. on Design Automation of Electronic Systems 8(1), 55–80 (2003)

    Article  Google Scholar 

  2. Zhuang, C., Sakanushi, K., Jin, L., Kajitani, Y.: An Extended Representation of Q-sequence for Optimizing Channel-Adjacency and Routing-Cost. In: The 2003 Conference on Asia South Pacific Design Automation, pp. 21–24 (2003)

    Google Scholar 

  3. Zhao, H.A., Liu, C., Kajitani, Y., Sakahushi, K.: EQ-Sequences for Coding Floorplans. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences E87-A (12), 3244–3250 (2004)

    Google Scholar 

  4. Fujimaki, R., Takahashi, T.: A Surjective Mapping from Permutations to Room-to- Room Floorplans. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences E90 -A(4), 823–828 (2007)

    Google Scholar 

  5. Yamanaka, K., Nakano, S.: Coding Floorplans with Fewer Bits. IEICE Trans. Fundamentals E89-A(5), 1181–1185 (2006)

    Google Scholar 

  6. Fujimaki, R., Inoue, Y., Takahashi, T.: An Asymptotic Estimate of the Numbers of Rectangular Drawings or Floorplans. In: The 2009 IEEE International Symposium on Circuits and Systems (2009)

    Google Scholar 

  7. Inoue, Y., Fujimaki, R., Takahashi, T.: Counting Rectangular Drawings or Floorplans in Polynomial Time. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences E92-A(4), 1115–1120 (2009)

    Google Scholar 

  8. Amano, K., Nakano, S., Yamanaka, K.: On the Number of Rectangular Drawings: Exact Counting and Lower and Upper Bounds. IPSJ SIG Notes, 2007-AL-115-5, pp. 33–40 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-02882-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02882-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02881-6

  • Online ISBN: 978-3-642-02882-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics