This question could be seen as a coordinate-free variant of Sylvester's Four Point Problem (cf e.g. http://mathworld.wolfram.com/SylvestersFour-PointProblem.html):
Suppose one are given an inifinitely thin stick of unit length, which fraction of the planar quadrilaterals you can generate by cutting the stick into six pieces (for the sides and diagonals) has a convex hull with four corners, when embedded into the euclidean plane?
In that setting, it is the number of non-similar quadrilaterals that counts, which means, that the same partitioning of the stick may yield several non-similar quadrilaterals, which are counted separately.