Enumerating Constrained Non-crossing Minimally Rigid Frameworks

Details Enumerating Constrained Non-crossing Minimally Rigid Frameworks Enumerating Constrained Non-crossing Minimally Rigid Frameworks

2006-08-03

arxiv.org/abs/math/0608102v2

Mathematics

Combinatorics

14 pages, 3 figures

Scientific paper

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 (also called constrained non-crossing Laman frameworks) on a given generic set of $n$ points. 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, 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 restore the Laman property.

Affiliated with

Also associated with

No associations

Rating

Enumerating Constrained Non-crossing Minimally Rigid Frameworks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumerating Constrained Non-crossing Minimally Rigid Frameworks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating Constrained Non-crossing Minimally Rigid Frameworks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50919