1. |
- Biedl, Therese, et al.
(författare)
-
Drawing Planar Graphs on Points Inside a Polygon
- 2012
-
Ingår i: Lecture Notes in Computer Science (Mathematical Foundations of Computer Science 2012). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783642325892 - 9783642325885 ; 7464, s. 172-183
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we study the problem of drawing a given planar graph such that vertices are at pre-specified points and the entire drawing is inside a given polygon. We give a method that shows that for an $n$-vertex graph and a $k$-sided polygon, $\Theta(kn^2)$ bends are always sufficient. We also give an example of a graph where $\Theta(kn^2)$ bends is necessary for such a drawing.
|
|
2. |
|
|
3. |
-
Graph Drawing and Network Visualization : 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings
- 2018
-
Proceedings (redaktörskap) (refereegranskat)abstract
- This book constitutes the refereed proceedings of the 26th International Symposium on Graph Drawing and Network Visualization, GD 2018, held in Barcelona, Spain, in September 2018. The 41 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: planarity variants; upward drawings; RAC drawings; orders; crossings; crossing angles; contact representations; specialized graphs and trees; partially fixed drawings, experiments; orthogonal drawings; realizability; and miscellaneous. The book also contains one invited talk in full paper length and the Graph Drawing contest report.
|
|