Shape fitting with outliers

13 years 10 months ago
Shape fitting with outliers
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), where c is a constant depending on d. The algorithm relies on computing a subset of H of size O(k/εd−1), in near linear time, such that the k-level of the arrangement of the subset approximates that of the original arrangement. Using this algorithm, we propose efficient approximation algorithms for shape fitting with outliers for various shapes. This is the first algorithms to handle outliers efficiently for the shape fitting problems considered.
Sariel Har-Peled, Yusu Wang
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Authors Sariel Har-Peled, Yusu Wang
Comments (0)