L-Graphs and Monotone L-Graphs

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each $\mathsf{L}$-segment in an $\mathsf{L}$-embedding lies on a straight line,...

Full description

Bibliographic Details

Main Authors:	Ahmed, Abu Reyan, De Luca, Felice, Devkota, Sabin, Efrat, Alon, Hossain, Md Iqbal, Kobourov, Stephen, Li, Jixian, Salma, Sammi Abida, Welch, Eric
Format:	Journal Article
Language:	English
Published:	04-03-2017
Subjects:	Computer Science - Computational Geometry
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!