Etablissement
Ecole Nationale Supérieure d'informatique
Affiliation
Département de Post-Graduation
Auteur
MOUSSAOUI, Adel
Directeur de thèse
AIT AOUDIA Samy (Professeur)
Filière
Informatique
Diplôme
Doctorat
Titre
Geometric Constraint Solver .
Mots clés
constraint solving, geometric constraints, graph-based constraint solvers, underconstrained systems, overconstrained systems.
Résumé
The aim of our work is to develop a geometric constraint solver. A solver has a primary interest in several areas such as: robotics, localization in mobile ad hoc networks, geometric modeling, molecular biology, etc. A geometric constraint system consists of a finite set of primitive geometric objects such as points, lines, planes, conics and so on and a finite set of geometric constraints between them such as distance, angle, incidence and so on. The solver task is to find the class of valid instantiations of the position, orientation and any other parameters of the geometric elements such that all constraints are satisfied. A constraint system can be classified as overconstrained, well-constrained, or underconstrained. Well-constrained systems have a finite number of solutions, underconstrained systems have infinitely many solutions and overconstrained systems do not have a solution.
Statut
Vérifié