One way to study the combinatorics of finite metric spaces is betweenness relation associated with space. In hypergraph metrization problem, one has find and characterize betweennesses collinear triples (or alternatively, non-degenerate triangles) that coincide edges a given 3-uniform hypergraph. Metrizability different kinds hypergraphs was investigated in last decades. Chen showed Steiner tri...