Efficient Robust Digital Hyperplane Fitting with Bounded Error - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Efficient Robust Digital Hyperplane Fitting with Bounded Error

Résumé

We consider the following fitting problem: given an arbitrary set of N points in a bounded grid in dimension d, find a digital hyperplane that contains the largest possible number of points. We first observe that the problem is 3SUM-hard in the plane, so that it probably cannot be solved exactly with computational complexity better than O(N 2), and it is conjectured that optimal computational complexity in dimension d is in fact O(N d ). We therefore propose two approximation methods featuring linear time complexity. As the latter one is easily implemented, we present experimental results that show the runtime in practice.

Dates et versions

hal-00790712 , version 1 (20-02-2013)

Identifiants

Citer

Dror Aiger, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer. Efficient Robust Digital Hyperplane Fitting with Bounded Error. 16th International Conference on Discrete Geometry for Computer Imagery, DGCI2011, Apr 2011, Nancy, France. pp.223-234, ⟨10.1007/978-3-642-19867-0_19⟩. ⟨hal-00790712⟩
92 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More