Enumerating Constrained Non-crossing Minimally Rigid Frameworks

概要

論文の詳細を見る
In this paper we present an algorithm for enumerating without repetitions all the non-crossing generically minimally rigid bar-and-joint frameworks under edge constraints, which we call constrained non-crossing Laman frameworks, on a given set of n points in the plane. Our algorithm is based on the reverse search paradigm of Avis and Fukuda. It generates each output graph in O(n 4) time and O(n) space, or, with a slightly different implementation, in O(n 3) time and O(n 2) space. In particular, we obtain that the set of all the constrained non-crossing Laman frameworks on a given point set is connected by flips which preserve the Laman property.