K-set Polygons and Centroid Triangulations
This thesis is a contribution to a classical problem in computational and combinatorial geometry: the study of the k-sets of a set V of n points in the plane. First we introduce the notion of convex inclusion chain that is an ordering of the points of V such that no point is inside the convex hull o...
| Main Author: | |
|---|---|
| Language: | ENG |
| Published: |
Université de Haute Alsace - Mulhouse
2009
|
| Subjects: | |
| Online Access: | http://tel.archives-ouvertes.fr/tel-00871192 http://tel.archives-ouvertes.fr/docs/00/87/11/92/PDF/2009MULH2962_these_ELORAIBY.pdf |