Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

Approximations of Points: Combinatorics and Algorithms

Abstract : At the core of successful manipulation and computation over large geometric data is the notion of approximation, both structural and computational. The focus of this thesis will be on the combinatorial and algorithmic aspects of approximations of point-set data P in d-dimensional Euclidean space. It starts with a study of geometric data depth where the goal is to compute a point which is the 'combinatorial center' of P. Over the past 50 years several such measures of combinatorial centers have been proposed, and we will re-examine several of them: Tukey depth, Simplicial depth, Oja depth and Ray-Shooting depth. This can be generalized to approximations with a subset, leading to the notion of epsilon-nets. There we will study the problem of approximations with respect to convexity. Along the way, this requires re-visiting and generalizing some basic theorems of convex geometry, such as the Caratheodory's theorem. Finally we will turn to the algorithmic aspects of these problems. We present a polynomial-time approximation scheme for computing hitting-sets for disks in the plane. Of separate interest is the technique, an analysis of local-search via locality graphs. A further application of this technique is then presented in computing independent sets in intersection graphs of rectangles in the plane.
Complete list of metadata

Cited literature [110 references]  Display  Hide  Download
Contributor : Nabil Mustafa <>
Submitted on : Wednesday, September 10, 2014 - 4:15:00 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:27 AM
Long-term archiving on: : Thursday, December 11, 2014 - 2:50:54 PM


  • HAL Id : tel-01062825, version 1


Nabil Mustafa. Approximations of Points: Combinatorics and Algorithms. Computational Geometry [cs.CG]. Université Paris-Est, 2013. ⟨tel-01062825⟩



Record views


Files downloads