Skip to Main content Skip to Navigation
Theses

K-set Polygons and Centroid Triangulations

Abstract : 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 of the points that precede it. Every k-set of an initial sub-sequence of the chain is called a k-set of the chain. We prove that the number of these k-sets is an invariant of V and is equal to the number of regions in the order-k Voronoi diagram of V. We then deduce an online algorithm for the construction of the k-sets of the vertices of a simple polygonal line such that every vertex of this line is outside the convex hull of all its preceding vertices on the line. If c is the total number of k-sets built with this algorithm, the complexity of our algorithm is in O(n log n + c log^2k) and is equal, per constructed k-set, to the complexity of the best algorithm known. Afterward, we prove that the classical divide and conquer algorithmic method can be adapted to the construction of the k-sets of V. The algorithm has a complexity of O(n log n + c log^2k log(n/k)), where c is the maximum number of k-sets of a set of n points. We finally prove that the centers of gravity of the k-sets of a convex inclusion chain are the vertices of a triangulation belonging to the family of so-called centroid triangulations. This family notably contains the dual of the order-k Voronoi diagram. We give an algorithm that builds particular centroid triangulations in O(n log n + k(n- k) log^2 k) time, which is more efficient than all the currently known algorithms.
Document type :
Theses
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00871192
Contributor : Abes Star :  Contact
Submitted on : Wednesday, October 9, 2013 - 9:22:40 AM
Last modification on : Wednesday, November 13, 2019 - 11:59:21 AM
Long-term archiving on: : Friday, January 10, 2014 - 4:22:52 AM

File

2009MULH2962_these_ELORAIBY.pd...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00871192, version 1

Collections

Citation

Wael El Oraiby. K-set Polygons and Centroid Triangulations. Other [cs.OH]. Université de Haute Alsace - Mulhouse, 2009. English. ⟨NNT : 2009MULH2962⟩. ⟨tel-00871192⟩

Share

Metrics

Record views

384

Files downloads

838