17 citations · 33 across the 4 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2014★ 5 cited
Computational Aspects of the Hausdorff Distance in Unbounded Dimension
Stefan König
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matc…
cs.CG2010★ 17 cited
No dimension independent Core-Sets for Containment under Homothetics
Rene Brandenberg, Stefan Koenig
This paper deals with the containment problem under homothetics which has the minimal enclosing ball (MEB) problem as a prominent representative. We connect the problem to results…