Aligned Drawings of Planar Graphs

August 29, 2017 Β· Declared Dead Β· πŸ› International Symposium Graph Drawing and Network Visualization

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter arXiv ID 1708.08778 Category cs.DS: Data Structures & Algorithms Cross-listed cs.CG Citations 6 Venue International Symposium Graph Drawing and Network Visualization Last Checked 4 months ago
Abstract
Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal{A}$ be an arrangement of pseudolines intersecting the drawing of $G$. An aligned drawing of $G$ and $\mathcal{A}$ is a planar polyline drawing $Ξ“$ of $G$ with an arrangement $A$ of lines so that $Ξ“$ and $A$ are homeomorphic to $G$ and $\mathcal{A}$. We show that if $\mathcal{A}$ is stretchable and every edge $e$ either entirely lies on a pseudoline or it has at most one intersection with $\mathcal{A}$, then $G$ and $\mathcal{A}$ have a straight-line aligned drawing. In order to prove this result, we strengthen a result of Da Lozzo et al., and prove that a planar graph $G$ and a single pseudoline $\mathcal{L}$ have an aligned drawing with a prescribed convex drawing of the outer face. We also study the less restrictive version of the alignment problem with respect to one line, where only a set of vertices is given and we need to determine whether they can be collinear. We show that the problem is NP-complete but fixed-parameter tractable.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted