A formalization of geometric constraint systems and their decomposition
- ISSN: 09345043
- DOI: 10.1007/s00165-009-0117-8
Abstract
Abstract For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on the invariance of systems under rigid motions. In order to decompose further, other invariance groups (e.g., scalings) have recently been considered. Geometric decomposition is grounded on the possibility to replace a solved subsystem with a smaller system called boundary. This article shows the central property that justifies decomposition, without assuming specific types of constraints or invariance groups. The exact nature of the boundary system is given. This formalization brings out the elements of a general and modular implementation.
Author-supplied keywords
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
