Optimization over k-set Polytopes and Efficient k-set Enumeration

We present two versions of an algorithm based on the reverse search technique for enumerating all k-sets of a point set in Rd. The key elements include the notion of a k-set polytope and the optimization of a linear function over a k-set polytope. In addition, we obtain several results related to the k-set polytopes. Among others, we show that the 1-skeleton of a k-set polytope restricted to vertices corresponding to the affine k-sets is not always connected.

[1]  Jirí Matousek,et al.  Constructing levels in arrangements and higher order Voronoi diagrams , 1994, SCG '94.

[2]  Herbert Edelsbrunner,et al.  Constructing Belts in Two-Dimensional Arrangements with Applications , 1986, SIAM J. Comput..

[3]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[4]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[5]  Herbert Edelsbrunner,et al.  Cutting dense point sets in half , 1994, SCG '94.

[6]  Artur Andrzejak,et al.  K-sets and j-facets - A tour of discrete geometry , 1997 .

[7]  Edoardo Amaldi,et al.  The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations , 1995, Theor. Comput. Sci..

[8]  Ketan Mulmuley,et al.  On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..

[9]  AurenhammerFranz.  Voronoi diagramsa survey of a fundamental geometric data structure , 1991 .

[10]  Jürg Nievergelt,et al.  The parallel search bench ZRAM and its applications , 1999, Ann. Oper. Res..

[11]  S. Kawasaki,et al.  Springer Verlag, Berlin, Heidelberg, New York (1995) , 1996 .

[12]  Thomas Ottmann,et al.  Enumerating Extreme Points in Higher Dimensions , 2001, Nord. J. Comput..

[13]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[14]  David Avis,et al.  A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1991, SCG '91.

[15]  KETAN MULMULEY.  Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements , 1993, J. Comput. Syst. Sci..

[16]  Bernard Chazelle,et al.  Halfspace range search: an algorithmic application of K-sets , 1985, SCG '85.

[17]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[18]  Noga Alon,et al.  Point Selections and Weak ε-Nets for Convex Hulls , 1992, Combinatorics, Probability and Computing.