Database of all combinatorially inequivalent point configurations (order types) of up to 11 points in the plane, with precomputed properties of each set.

Oswin Aichholzer, Hannes Krasser

Complete database of all order types of n points in the plane in general position, realized by integer-coordinate point sets, for 3 <= n <= 11, together with companion files of extremal values per order type (rectilinear crossing number, numbers of triangulations, crossing-free Hamiltonian cycles, spanning trees and matchings, k-gons and empty k-gons, k-sets, convex cover/partition/decomposition numbers, extreme points). Files for up to 10 points are downloadable; the 11-point extension (2,334,512,907 order types, 96 GB) is available on request.

References

  • doi:10.1023/A:1021231927255
  • O. Aichholzer, H. Krasser, The point set order type data base: a collection of applications and results, Proc. 13th Canadian Conference on Computational Geometry (CCCG 2001), 17-20
  • O. Aichholzer, H. Krasser, Abstract order type extension and new results on the rectilinear crossing number, Computational Geometry: Theory and Applications 36(1) (2006), 2-15