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...
محفوظ في:
| المؤلفون الرئيسيون: | , , , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Carleton University
2018-05-01
|
| سلاسل: | Journal of Computational Geometry |
| الوصول للمادة أونلاين: | https://jocg.org/index.php/jocg/article/view/3050 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|