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...
I tiakina i:
| Ngā kaituhi matua: | , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Carleton University
2024-10-01
|
| Rangatū: | Journal of Computational Geometry |
| Urunga tuihono: | https://jocg.org/index.php/jocg/article/view/4104 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|