37 citations · 192 across the 51 of their papers we have counts for
6 papers · 2 filters
Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)
Daniel Archambault, Csaba D. Tóth
This is the arXiv index for the electronic proceedings of GD 2019, which contains the peer-reviewed and revised accepted papers with an optional appendix. Proceedings (without appe…
Simple -Planar Graphs are Simple -Quasiplanar
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8
A simple topological graph is -quasiplanar () if it contains no pairwise crossing edges, and -planar if no edge is crossed more than times. In this paper, we…
Atomic Embeddability, Clustered Planarity, and Thickenability
Radoslav Fulek, Csaba D. Tóth
We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polyno…
Rock Climber Distance: Frogs versus Dogs
Hugo A. Akitaya, Leonie Ryvkin, Csaba D. Tóth
The classical measure of similarity between two polygonal chains in Euclidean space is the Fréchet distance, which corresponds to the coordinated motion of two mobile agents along…
On the Stretch Factor of Polygonal Chains
Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer +1
Let be a polygonal chain in . The stretch factor of is the ratio between the total length of and the distance of its endpoints, $\s…
Circumscribing Polygons and Polygonizations for Disjoint Line Segments
Hugo A. Akitaya, Matias Korman, Oliver Korten +3
Given a planar straight-line graph in , a \emph{circumscribing polygon} of is a simple polygon whose vertex set is , and every edge in is eit…