Algorithm 681: INTBIS, a portable interval Newton/bisection package
ACM Transactions on Mathematical Software (TOMS)
Ritt-Wu's decomposition algorithm and geometry theorem proving
CADE-10 Proceedings of the tenth international conference on Automated deduction
Algebraic solution for geometry from dimensional constraints
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Conditions for unique graph realizations
SIAM Journal on Computing
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)
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
A systematic framework for solving geometric constraints analytically
Journal of Symbolic Computation
Sketch-based pruning of a solution space within a formal geometric constraint solver
Artificial Intelligence
Computable analysis: an introduction
Computable analysis: an introduction
FRONTIER: fully enabling geometric constraints for feature-based modeling and assembly
Proceedings of the sixth ACM symposium on Solid modeling and applications
Solving Geometric Constraints By Homotopy
IEEE Transactions on Visualization and Computer Graphics
Probabilistic Verification of Elementary Geometry Statements
Selected Papers from the International Workshop on Automated Deduction in Geometry
Combining symbolic and numerical solvers to simplify indecomposable systems solving
Proceedings of the 2008 ACM symposium on Applied computing
Nonlinear systems solver in floating-point arithmetic using LP reduction
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Interrogating witnesses for geometric constraint solving
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Algorithms for identifying rigid subsystems in geometric constraint systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
Computer-Aided Design
A correct rule-based geometric constraint solver
Computers and Graphics
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
Computer-Aided Design
A formalization of geometric constraint systems and their decomposition
Formal Aspects of Computing
Decomposition of geometrical constraint systems with reparameterization
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Defining tools to address over-constrained geometric problems in Computer Aided Design
Computer-Aided Design
Coordinate-free geometry and decomposition in geometrical constraint solving
Computer-Aided Design
| Hi-index | 0.00 |
This paper describes new ways to tackle several important problems encountered in geometric constraint solving, in the context of CAD, and which are linked to the handling of under- and over-constrained systems. It presents a powerful decomposition algorithm of such systems. Our methods are based on the witness principle whose theoretical background is recalled in a first step. A method to generate a witness is then explained. We show that having a witness can be used to incrementally detect over-constrainedness and thus to compute a well-constrained boundary system. An algorithm is introduced to check if anchoring a given subset of the coordinates brings the number of solutions to a finite number. An algorithm to efficiently identify all maximal well-constrained parts of a geometric constraint system is described. This allows us to design a powerful algorithm of decomposition, called W-decomposition, which is able to identify all well-constrained subsystems: it manages to decompose systems which were not decomposable by classic combinatorial methods.