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...
Guardat en:
| Autors principals: | , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Carleton University
2018-05-01
|
| Col·lecció: | Journal of Computational Geometry |
| Accés en línia: | https://jocg.org/index.php/jocg/article/view/3050 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|