3 papers
cs.CG2019
Triangles and Girth in Disk Graphs and Transmission Graphs
Haim Kaplan, Katharina Klost, Wolfgang Mulzer +3
Let be a set of sites, where each has an associated radius . The disk graph is the undirected graph with vertex set and a…
cs.CG2019
Routing in Histograms
Man-Kwun Chiu, Jonas Cleve, Katharina Klost +5
Let be an -monotone orthogonal polygon with vertices. We call a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizonta…
cs.CG2017
Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors
Katharina Klost, Wolfgang Mulzer
Suppose we have an arrangement of geometric objects in the plane, with a distinguished point in each object .…