Autor:	Tóth, Csaba D.
Rok vydání:	2023
Předmět:	Computer Science - Discrete Mathematics Computer Science - Computational Geometry
Druh dokumentu:	Working Paper
Popis:	It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$. This improves upon the previous upper bound of $74.2n$; this is the first improvement in more than 12 years. A crucial ingredient of the proof is an upper bound on the size of plane multigraphs with polyline edges in which the first and last segments are either parallel or orthogonal. Comment: Presented at the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2308.02663 Zobrazit plný text záznamu View this record from Arxiv