Equilateral L-contact graphs

13Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider L-graphs, that is contact graphs of axis-aligned L-shapes in the plane, all with the same rotation. We provide several characterizations of L-graphs, drawing connections to Schnyder realizers and canonical orders of maximally planar graphs. We show that every contact system of L's can always be converted to an equivalent one with equilateral L's. This can be used to show a stronger version of a result of Thomassen, namely, that every planar graph can be represented as a contact system of square-based cuboids. We also study a slightly more restricted version of equilateral L-contact systems and show that these are equivalent to homothetic triangle contact representations of maximally planar graphs. We believe that this new interpretation of the problem might allow for efficient algorithms to find homothetic triangle contact representations, that do not use Schramm's monster packing theorem. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Chaplick, S., Kobourov, S. G., & Ueckerdt, T. (2013). Equilateral L-contact graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8165 LNCS, pp. 139–151). Springer Verlag. https://doi.org/10.1007/978-3-642-45043-3_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free