8 citations · 23 across the 7 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2018
The Crossing Tverberg Theorem
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii +2
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set of at least points in , one can find a partition $X=…
cs.CG2009
Clarksons Algorithm for Violator Spaces
Yves Brise, Bernd Gärtner
Clarksons algorithm is a two-staged randomized algorithm for solving linear programs. This algorithm has been simplified and adapted to fit the framework of LP-type problems. In th…
cs.CG2008
Ranking Unit Squares with Few Visibilities
Bernd Gärtner
Given a set of n unit squares in the plane, the goal is to rank them in space in such a way that only few squares see each other vertically. We prove that ranking the squares accor…