29 citations · 74 across the 56 of their papers we have counts for
4 papers · 1 filter
The Zarankiewicz Problem for Polygon Visibility Graphs
Eyal Ackerman, Balázs Keszegh
We prove a quasi-linear upper bound on the size of -free polygon visibility graphs. For visibility graphs of star-shaped and monotone polygons we show a linear bound. In t…
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii +4
We study spanners in planar domains, including polygonal domains, polyhedral terrain, and planar metrics. Previous work showed that for any constant , one could constru…
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks
Balázs Keszegh, Dömötör Pálvölgyi
We study general Delaunay-graphs, which are natural generalizations of Delaunay triangulations to arbitrary families, in particular to pseudo-disks. We prove that for any finite ps…
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms
Rinat Ben-Avraham, Matthias Henze, Rafel Jaume +4
We consider the RMS distance (sum of squared distances between pairs of points) under translation between two point sets in the plane, in two different setups. In the partial-match…