Conditions for unique graph realizations
SIAM Journal on Computing
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
Geometric construction by assembling solved subfigures
Artificial Intelligence
Combining constructive and equational geometric constraint-solving techniques
ACM Transactions on Graphics (TOG)
Using Graph Decomposition for Solving Continuous CSPs
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Helping the Designer in Solution Selection: Applications in CAD
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Modeling Camera Control with Constrained Hypertubes
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Inter-block backtracking: exploiting the structure in continuous CSPs
COCOS'03 Proceedings of the Second international conference on Global Optimization and Constraint Satisfaction
| Hi-index | 0.00 |
This paper introduces a new rigidification method -using interval constraint programming techniques- to solve geometric constraint systems. Standard rigidification techniques are graph-constructive methods exploiting the degrees of freedom of geometric objects. They work in two steps: a planning phase which identifies rigid clusters, and a solving phase which computes the coordinates of the geometric objects in every cluster. We propose here a new heuristic for the planning algorithm that yields in general small systems of equations. We also show that interval constraint techniques can be used not only to efficiently implement the solving phase, but also generalize former ad-hoc solving techniques. First experimental results show that this approach is more efficient than systems based on equational decomposition techniques.