Strictly-convex drawings of 3-connected planar graphs
Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings of $n$-vertex graphs is $O(n^2) \times O(n^2)$, as shown by Bárány and Rote by means of a sophisticated techni...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Carleton University
2024-10-01
|
| Col·lecció: | Journal of Computational Geometry |
| Accés en línia: | https://jocg.org/index.php/jocg/article/view/4104 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|