Drawing planar graphs with many collinear vertices
Consider the following problem: Given a planar graph $G$, what is the maximum number $p$ such that $G$ has a planar straight-line drawing with $p$ collinear vertices? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planar...
Furkejuvvon:
| Váldodahkkit: | , , , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Carleton University
2018-05-01
|
| Ráidu: | Journal of Computational Geometry |
| Liŋkkat: | https://jocg.org/index.php/jocg/article/view/3050 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|