Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitleReduction of constraint systems
Author(s) Samy Ait-Aoudia, Roland Jegou, Dominique Michelucci
TextSamy Ait-Aoudia, Roland Jegou, and Dominique Michelucci. Reduction of constraint systems. In Compugraphic, 1993.
TypeTechnical Report, Misc
AbstractGeometric modeling by constraints leads to large systems of algebraic
equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into well constrained, over-, and underconstrained subsystems. This paper also gives an efficient method to decompose well constrained systems into irreducible ones. These decompositions greatly speed up the resolution in case of reducible systems. They also allow debugging systems of constraints.
Keywordsgeometric modeling, constraints, bipartite graphs, matching, maximum matching, perfect matching
Translation No
Refereed No