10 citations · 25 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021★ 1 cited
A Characterization of the Realizable Matoušek Unique Sink Orientations
Simon Weber, Bernd Gärtner
The Matoušek LP-type problems were used by Matoušek to show that the Sharir-Welzl algorithm may require at least subexponential time. Later, Gärtner translated this result into the…
cs.CG2021★ 2 cited
Topological Art in Simple Galleries
Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow +2
Let be a simple polygon, then the art gallery problem is looking for a minimum set of points (guards) that can see every point in . We say two points can see each…