Towards an homogeneous handling of under-constrained and well-constrained systems of geometric constraints
SAC07 Proceedings of the 22ndd ACM Symposium on Applied Computing (2007)
Available from portal.acm.org
or
Abstract
Most of the geometric constraints solvers consider systems of constraints well-constrained modulo the rigid motions group, and either halt on error when they encounter under-constrained sub-systems, or attempt to add parameterized constraints so as to get rid of the under-constriction. We studied transformations groups making well-constrained some problems that are usually considered as under-constrained. This leads to new algorithms which allow an homogeneous handling of systems of geometric constraints and thus a better adaptation to the needs of the user.
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
Start using Mendeley in seconds!
Readership Statistics
1 Reader on Mendeley
by Discipline
by Academic Status
100% Researcher (at an Academic Institution)
by Country
100% France
