Points module¶

Module providing point set generators to many families of point sets. It also provides access to Graz’s order point database for n=6,7,8,9,10

points.convex_position(n)¶

Returns a set of n points in convex and general position

points.eight()¶

Returns an array with integer coordinate realizations of every ordertype of 8 points

points.five()¶

Returns an array with integer coordinate realizations of every ordertype of 5 points

points.four()¶

Returns an array with integer coordinate realizations of every ordertype of 4 points

points.horton_set(n)¶

Returns a set of n points with the same order type as the Horton Set. It should be pointed out that horton sets have 2^k points in the case for when n is not a power of 2 we compute the Horton set of 2^k points for the first value of k such that 2^k>=n. Afterwards we just return the first n points.

For more details see our paper: Drawing the Horton Set in an Integer Grid of Minimum Size

points.nine()¶

Returns an array with integer coordinate realizations of every ordertype of 9 points

points.point_set_array(n)¶

Returns an an array with integer coordinate realizations of every ordertype of n points

points.point_set_iterator(n)¶

Returns an iterator that provides integer coordinate realizations of every ordertype n points

points.seven()¶

Returns an array with integer coordinate realizations of every ordertype of 7 points

points.six()¶

Returns an array with integer coordinate realizations of every ordertype of 6 points

points.ten()¶

Returns an iterator that provides integer coordinate realizations of every ordertype of 10 points. It uses a LOT of memory; use at your own risk. Perhaps you should use the iterator point_set_iterator(10) instead

points.three()¶

Returns an array with integer coordinate realizations of every ordertype of 3 points