A redundancy eliminating approach to linearly independent rings selection in the ring perception problem

摘要

Based on a recently published efficient, exact algorithm to solve the ring perception problem, a new approach is presented to feed the linear independence test on rings to enter a minimal basis with no duplicate information, thus reducing calls to the most demanding procedure in terms of computational order. The efficiency of a perfect hashing algorithm is actually met by a "pre-filtering" method derived from simple considerations.