Before revision:  We show that for the purpose of counting crossing-free geometric graphs on  P, it suffices to know the so-calledfrequency vector of P.
After revision:  We show that for the purpose of counting crossing-free geometric graphs on such a set P, it suffices to know the so-calledfrequency vector of P.