Computer Science – Computational Geometry
Scientific paper
2010-10-20
Computer Science
Computational Geometry
Scientific paper
This paper deals with the containment problem under homothetics, a
generalization of the minimal enclosing ball problem. We present some new
geometric identities and inequalities in the line of Jung's theorem and show
how those effect the hope on fast approximation algorithms using small
core-sets.
Brandenberg Rene
Koenig Stefan
No associations
LandOfFree
No dimension independent Core-Sets for Containment under Homothetics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with No dimension independent Core-Sets for Containment under Homothetics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and No dimension independent Core-Sets for Containment under Homothetics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-717308