Skip to main content

Plattenbauten: Touching Rectangles in Space

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2020)

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

Included in the following conference series:

Abstract

Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in \(\mathbb {R}^2\). We study a generalization in space, namely, touching graphs of axis-aligned rectangles in \(\mathbb {R}^3\). We prove that planar 3-colorable graphs can be represented as touching graphs of axis-aligned rectangles in \(\mathbb {R}^3\). The result implies a characterization of corner polytopes previously obtained by Eppstein and Mumford. A by-product of our proof is a distributive lattice structure on the set of orthogonal surfaces with given skeleton.

Moreover, we study the subclass of strong representations, i.e., families of axis-aligned rectangles in \(\mathbb {R}^3\) in general position such that all regions bounded by the rectangles are boxes. We show that the resulting graphs correspond to octahedrations of an octahedron. This generalizes the correspondence between planar quadrangulations and families of horizontal and vertical segments in \(\mathbb {R}^2\) with the property that all regions are rectangles.

Omitted proofs and more figures can be found in the full version  [11].

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 EPUB and 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

Notes

  1. 1.

    We use the term touching graphs rather than the more standard contact graph to underline the fact that segments with coinciding endpoints (e.g., two horizontal segments touching a vertical segment in the same point but from different sides, but also non-parallel segments with coinciding endpoint) do not form an edge.

  2. 2.

    Plattenbau (plural Plattenbauten) is a German word describing a building (Bau) made of prefabricated concrete panels (Platte).

References

  1. Bowers, P.L.: Circle packing: a personal reminiscence. In: The Best Writing on Mathematics, pp. 330–345 (2010)

    Google Scholar 

  2. Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms (TALG) 4(1), 1–28 (2008)

    Article  MathSciNet  Google Scholar 

  3. Chandran, L.S., Mathew, R., Sivadasan, N.: Boxicity of line graphs. Discr. Math. 311(21), 2359–2367 (2011)

    Article  MathSciNet  Google Scholar 

  4. De Fraysseix, H., de Mendez, P.O.: On topological aspects of orientations. Discr. Math. 229(1–3), 57–72 (2001)

    Article  MathSciNet  Google Scholar 

  5. Deniz, Z., Galby, E., Munaro, A., Ries, B.: On Contact Graphs of Paths on a Grid. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 317–330. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04414-5_22

    Chapter  Google Scholar 

  6. Eppstein, D., Mumford, E.: Steinitz theorems for simple orthogonal polyhedra. J. Comput. Geom. 5(1), 179–244 (2014)

    MathSciNet  MATH  Google Scholar 

  7. Felsner, S.: Geometric Graphs and Arrangements. Advanced Lectures in Mathematics. Vieweg+Teubner Verlag, Wiesbaden (2004). https://doi.org/10.1007/978-3-322-80303-0

  8. Felsner, S.: Lattice structures from planar graphs. Electr. J. Comb. 11(R15), 24p (2004)

    MathSciNet  MATH  Google Scholar 

  9. Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Mathematics and StatisticsMathematics and Statistics, pp. 213–248. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-0110-0_12

    Chapter  Google Scholar 

  10. Felsner, S., Fusy, É., Noy, M., Orden, D.: Bijections for Baxter families and related objects. J. Comb. Theor. Ser. A 118(3), 993–1020 (2011)

    Article  MathSciNet  Google Scholar 

  11. Felsner, S., Knauer, K., Ueckerdt, T.: Plattenbauten: touching rectangles in space. ArXiv preprints (2020)

    Google Scholar 

  12. Fusy, É.: Combinatoire des cartes planaires et applications algorithmiques. Ph.D., thesis (2007)

    Google Scholar 

  13. Gonçalves, D.: 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes. In: Sau, I., Thilikos, D.M. (eds.) WG 2019. LNCS, vol. 11789, pp. 351–363. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-30786-8_27

    Chapter  Google Scholar 

  14. Hansen, T., Scarf, H.: The Computation of Economic Equilibria. Cowles Foundation Monograph, vol. 24. Yale University Press, London (1973)

    Google Scholar 

  15. Hartman, I.B.-A., Newman, I., Ziv, R.: On grid intersection graphs. Discr. Math. 87(1), 41–52 (1991)

    Google Scholar 

  16. Koebe, P.: Kontaktprobleme der konformen Abbildung. Hirzel (1936)

    Google Scholar 

  17. Koźmiński, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 15(2), 145–157 (1985)

    Article  MathSciNet  Google Scholar 

  18. Leinwand, S.M., Lai, Y.-T.: An algorithm for building rectangular floor-plans. In: 21st Design Automation Conference Proceedings, pp. 663–664. IEEE (1984)

    Google Scholar 

  19. Miller, E.: Planar graphs as minimal resolutions of trivariate monomial ideals. Doc. Math. 7, 43–90 (2002)

    MathSciNet  MATH  Google Scholar 

  20. Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics. Springer, New York (2004)

    MATH  Google Scholar 

  21. Pach, J., de Fraysseix, H., de Mendez, P.: Representation of planar graphs by segments. North-Holland, Technical report (1994)

    MATH  Google Scholar 

  22. Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete & Computational Geometry 1(4), 343–353 (1986). https://doi.org/10.1007/BF02187706

    Article  MathSciNet  MATH  Google Scholar 

  23. Stephenson, K.: Introduction to Circle Packing: The Theory of Discrete Analytic Functions. Cambridge University Press, Cambridge (2005)

    MATH  Google Scholar 

  24. Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete & Computational Geometry 1(4), 321–341 (1986). https://doi.org/10.1007/BF02187705

    Article  MathSciNet  MATH  Google Scholar 

  25. Thomassen, C.: Interval representations of planar graphs. J. Comb. Theor. Ser. B 40(1), 9–20 (1986)

    Article  MathSciNet  Google Scholar 

  26. Ueckerdt, T.: Geometric representations of graphs with low polygonal complexity. Doctoral thesis, Technische Universität Berlin, Fakultät II - Mathematik und Naturwissenschaften, Berlin (2012). https://doi.org/10.14279/depositonce-3190

  27. Ungar, P.: On diagrams representing graphs. J. London Math. Soc. 28, 336–342 (1953)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Torsten Ueckerdt .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Felsner, S., Knauer, K., Ueckerdt, T. (2020). Plattenbauten: Touching Rectangles in Space. In: Adler, I., Müller, H. (eds) Graph-Theoretic Concepts in Computer Science. WG 2020. Lecture Notes in Computer Science(), vol 12301. Springer, Cham. https://doi.org/10.1007/978-3-030-60440-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-60440-0_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-60439-4

  • Online ISBN: 978-3-030-60440-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics