Skip to main content
Springer Nature Link
Log in

A Compact Encoding of Rectangular Drawings with Efficient Query Supports

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4508))

Included in the following conference series:

  • 795 Accesses

Abstract

A rectangular drawing is a plane drawing in which every face is a rectangle. In this paper we give a simple encoding scheme for rectangular drawings. Given a rectangular drawing R with maximum degree 3, our scheme encodes R with \(\frac{5}{3}m + o(n)\) bits for each n-vertex rectangular drawing R, where m is the number of edges of R, and supports a rich set of queries, including adjacency and degree queries on the faces, in constant time.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proc. of SODA 2001, pp. 506–515 (2001)

    Google Scholar 

  2. Chuang, R.C.-N., Garg, A., He, X., Kao, M.-Y., Lu, H.-I.: Compact encodings of planar graphs via canonical orderings and multiple parentheses. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 118–129. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Clark, D.: Compact pat trees. Ph. D., thesis, Department of Computer Science, University of Waterloo (1998)

    Google Scholar 

  4. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete mathematics, 2nd edn. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  5. He, X.: On floor-plan of plane graph. SIAM J. on Comput. 28(6), 2150–2167 (1999)

    Article  MATH  Google Scholar 

  6. Jacobson, G.: Succinct static data structures. Ph. D., thesis CMU-CS-89-112, Carnegie Mellon University (1989)

    Google Scholar 

  7. Keeler, K., Westbrook, J.: Short encodings of planar graphs and maps. Discrete Applied Math. 58(3), 239–252 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: Proc. of FOCS 1997, pp. 118–126 (1997)

    Google Scholar 

  9. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762–776 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Nakano, S.: Enumerating floorplans with n rooms. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 107–115. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Nakano, S.: Enumerating floorplans with some properties. Interdisciplinary Information Sciences 8(2), 199–206 (2002)

    MATH  MathSciNet  Google Scholar 

  12. Papadimitriou, C., Yannakakis, M.: A note on succinct representations of graphs. Information and Control 71, 181–185 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  13. Rosen, K.H. (ed.): Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton (2000)

    MATH  Google Scholar 

  14. Turan, G.: Succinct representations of graphs. Discrete Applied Math. 8, 289–294 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  15. Yeap, K.-H., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J. Comput. 22, 500–526 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho Kiryu, Gunma, 376-8515, Japan

    Katsuhisa Yamanaka & Shin-Ichi Nakano

Authors
  1. Katsuhisa Yamanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shin-Ichi Nakano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ming-Yang Kao Xiang-Yang Li

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Yamanaka, K., Nakano, SI. (2007). A Compact Encoding of Rectangular Drawings with Efficient Query Supports. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72870-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72870-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72868-9

  • Online ISBN: 978-3-540-72870-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics