Divide and Conquer Method for k-Set Polygons

Authors:
Wael Oraiby;Dominique Schmitt
Affiliations:
Laboratoire MIA, Université de Haute-Alsace, Mulhouse Cedex, France 68093;Laboratoire MIA, Université de Haute-Alsace, Mulhouse Cedex, France 68093
Venue:
Computational Geometry and Graph Theory
Year:
2008

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
On k-hulls and related problems

SIAM Journal on Computing
Point sets with many k-sets

Proceedings of the sixteenth annual symposium on Computational geometry
Optimization over k-set Polytopes and Efficient k-set Enumeration

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Dynamic Planar Convex Hull

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
k-sets of convex inclusion chains of planar point sets

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k -sets of a set V of points in the plane are the subsets of k points of V that can be separated from the rest by a straight line. In order to find all the k -sets of V , one can build the so called k -set polygon whose vertices are the centroids of the k -sets of V . In this paper, we extend the classical convex-hull divide and conquer construction method to build the k -set polygon.