23 citations · 67 across the 33 of their papers we have counts for
36 papers
Diameter and Length of Metric Graphs
Hee-Kap Ahn, Sergio Cabello, Otfried Cheong +2
A metric graph is a metric space obtained from a finite collection of intervals whose endpoints are identified in groups. It can also be seen as a finite, edge-weighted graph where…
Better Late than Never: the Complexity of Arrangements of Polyhedra
Boris Aronov, Sang Won Bae, Sergio Cabello +4
Let be the subdivision of induced by convex polyhedra having facets in total. We prove that has combinatorial complexity $O(m^{\l…
Geometric Matching and Bottleneck Problems
Sergio Cabello, Siu-Wing Cheng, Otfried Cheong +1
Let be a set of at most points and let be a set of at most geometric ranges, such as for example disks or rectangles, where each has an associated supply…
Weakly and Strongly Fan-Planar Graphs
Otfried Cheong, Henry Förster, Julia Katheder +2
We study two notions of fan-planarity introduced by (Cheong et al., GD22), called weak and strong fan-planarity, which separate two non-equivalent definitions of fan-planarity in t…
The thickness of fan-planar graphs is at most three
Otfried Cheong, Maximilian Pfister, Lena Schlipf
We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that…
The Topology of the set of line Transversals
Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen
We prove that for any set of pairwise disjoint open convex sets in , the connected components of the set of lines intersecting every member of are co…