Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
نویسندگان
چکیده
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in geometric constraint satisfaction problems (GCSPs). However, it may fail even on simple GCSPs because it does not take geometric properties into account. In this paper, we question the flow-based algorithm used by Hoffmann et al. to identify rigid subGCSPs. We show that this algorithm may fail because of the structural rigidity, but also by design. We introduce a new flow-based algorithm which uses Jermann et al.’s characterization of rigidity. We show that this algorithm is correct in 2D and 3D, and can be used to tackle the major issues related to rigidity: deciding whether a GCSP is rigid or not and identifying rigid (or over-rigid) subGCSPs.
منابع مشابه
Elimination in generically rigid 3D geometric constraint systems
Modern geometric constraint solvers use combinatorial graph algorithms to recursively decompose the system of polynomial constraint equations into generically rigid subsystems and then solve the overall system by solving subsystems, from the leave nodes up, to be able to access any and all solutions. Since the overall algebraic complexity of the solution task is dominated by the size of the lar...
متن کاملSolving minimal, wellconstrained, 3D geometric constraint systems: combinatorial optimization of algebraic complexity
Many geometric constraint solvers use a combinatorial or graph algorithm to generate a decompositionrecombination (DR) plan. A DR plan recursively decomposes the system of polynomial equations into small, generically rigid subsystems that are more likely to be successfully solved by algebraic-numeric solvers. In this paper we show that, especially for 3D geometric constraint systems, a further ...
متن کاملWell-formed Systems of Point Incidences for Resolving Collections of Rigid Bodies
For tractability, many modern geometric constraint solvers recursively decompose an input geometric constraint system into standard collections of smaller, generically rigid subsystems or clusters. These are recursively solved and their solutions or realizations are recombined to give the solution or realization of the input constraint system. The recombination of a standard collection of solve...
متن کاملA New Structural Rigidity for Geometric Constraint Systems
The structural rigidity property, a generalization of Laman's theorem which characterizes rigid bar frameworks in 2D, is generally considered a good heuristic to detect rigidities in a geometric constraint satisfaction problem (GCSP). The gap between rigidity and structural rigidity essentially resides in the fact that structural rigidity is not a geometric property. In this article, we propose...
متن کاملA Tractable, Approximate, Combinatorial 3D rigidity characterization
There is no known, tractable, characterization of 3D rigidity of sets of points constrained by pairwise distances or 3D distance constraint graphs. We give a combinatorial approximate characterization of such graphs which we call module-rigidity, which can be determined by a polynomial time algorithm. We show that this property is natural and robust in a formal sense. Rigidity implies module-ri...
متن کامل