In Axioms and Hulls, Knuth defines the notion of a CC system, which is a generalization of Euclidean points in general position. While all such arrangements of points in the plane give a CC system, not all CC systems give an arrangement of points, i.e. are not realizable. Is there a polynomial-time procedure to determine if a given CC system is realizable?
Determine if CC system is realizable
computational geometry