2 papers
math.CO2021
On the number of hyperedges in the hypergraph of lines and pseudo-discs
Chaya Keller, Balázs Keszegh, Dömötör Pálvölgyi
Consider the hypergraph whose vertex set is a family of lines in general position in the plane, and whose hyperedges are induced by intersections with a family of pseudo-discs.…
math.CO2013
Covering Paths for Planar Point Sets
Adrian Dumitrescu, Daniel Gerbner, Balazs Keszegh +1
Given points in the plane, a \emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least …