{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:41:15Z","timestamp":1787323275722,"version":"build-2736575974"},"reference-count":33,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FE-340\/11-1"],"award-info":[{"award-number":["FE-340\/11-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in [Formula: see text]. We study a generalization in space\u2014touching graphs of axis-aligned rectangles in [Formula: see text]\u2014and prove that planar 3-colorable graphs can be represented this way. 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. Further, we study representations by axis-aligned non-coplanar rectangles in [Formula: see text] such that all regions 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 [Formula: see text] with the property that all regions are rectangles.<\/jats:p>","DOI":"10.1137\/23m160116x","type":"journal-article","created":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:01:11Z","timestamp":1745208071000},"page":"752-782","source":"Crossref","is-referenced-by-count":0,"title":["Plattenbauten: Touching Rectangles in Space"],"prefix":"10.1137","volume":"39","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, 10823 Berlin, Germany."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kolja","family":"Knauer","sequence":"additional","affiliation":[{"name":"Departament de Matem\u00e0tiques i Inform\u00e0tica, Universitat de Barcelona, Barcelona, Spain, and Aix-Marseille Univ, Universit\u00e9 de Toulon, CNRS, LIS, Marseille, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[{"name":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology, 76131 Karlsruhe, Germany."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2025,4,21]]},"reference":[{"key":"ref1","first-page":"330","volume-title":"The Best Writing on Mathematics 2010","author":"Bowers P. L.","year":"2010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328919"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.06.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00201-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04414-5_22"},{"key":"ref6","unstructured":"D. Eppstein, Regular labelings and geometric structures, in Proceedings of the Canadian Conference on Computational Geometry, 2010, pp. 125\u2013130, arxiv.org\/abs\/1007.0221."},{"key":"ref7","first-page":"179","volume":"5","author":"Eppstein D.","year":"2014","journal-title":"J. Comput. Geom."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010604726900"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-80303-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.37236\/1768"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0110-0_12"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/130945284"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2010.03.017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60440-0_13"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9027-9"},{"key":"ref16","unstructured":"\u00c9. Fusy, Combinatoire des cartes planaires et applications algorithmiques, Ph.D. thesis, LIX Polytechnique, 2007, https:\/\/www.lix.polytechnique.fr\/Labo\/Eric.Fusy\/Theses\/these_eric_fusy.pdf."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.37236\/11174"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30786-8_27"},{"key":"ref19","series-title":"Cowles Found. Monogr. 24","volume-title":"The Computation of Economic Equilibria","author":"Hansen T.","year":"1973"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90069-E"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00315-X"},{"key":"ref22","first-page":"141","volume":"88","author":"Koebe P.","year":"1936","journal-title":"Mathematisch-Physische Klasse"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150202"},{"key":"ref24","doi-asserted-by":"crossref","unstructured":"S. M. Leinwand and Y.T. Lai, An algorithm for building rectangular floor-plans, in Proceedings of the 21st Design Automation Conference, IEEE, 1984, pp. 663\u2013664, https:\/\/doi.org\/10.1109\/DAC.1984.1585874.","DOI":"10.1109\/DAC.1984.1585874"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.4171\/dm\/117"},{"key":"ref26","series-title":"Grad. Texts in Math. 227","volume-title":"Combinatorial Commutative Algebra","author":"Miller E.","year":"2004"},{"key":"ref27","series-title":"Coll. Math. Soc. J. Bolyai 63","first-page":"109","volume-title":"Intuitive Geometry","author":"Pach J.","year":"1994"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187706"},{"key":"ref29","volume-title":"Introduction to Circle Packing: The Theory of Discrete Analytic Functions","author":"Stephenson K.","year":"2005"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187705"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90061-4"},{"key":"ref32","unstructured":"T. Ueckerdt, Geometric Representations of Graphs with Low Polygonal Complexity, Doctoral thesis, Technische Universit\u00e4t Berlin, Fakult\u00e4t II - Mathematik und Naturwissenschaften, Berlin, 2012, https:\/\/doi.org\/10.14279\/depositonce-3190."},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-28.3.336"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/23M160116X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:52:18Z","timestamp":1787320338000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M160116X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,21]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1137\/23M160116X"],"URL":"https:\/\/doi.org\/10.1137\/23m160116x","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,21]]}}}