This paper proposes the pre-efficiency based on classical geometric probability as a measurement of efficiency of integer labellings in simplicial fixed point algorithms. Numerical experiment shows that
higher pre-efficiency of labellings results higher efficiency of computations.