A homotopy for solving general polynomial systems that respects m-homogenous structures
Applied Mathematics and Computation
Algebraic solution for geometry from dimensional constraints
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Using geometric rewrite rules for solving geometric problems symbolically
Theoretical Computer Science
Mechanical theorem proving in geometries
Mechanical theorem proving in geometries
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
Geometric construction by assembling solved subfigures
Artificial Intelligence
A systematic framework for solving geometric constraints analytically
Journal of Symbolic Computation
Decomposition plans for geometric constraint problems, part II: new algorithms
Journal of Symbolic Computation
Solving spatial basic geometric constraint configurations with locus intersection
Proceedings of the seventh ACM symposium on Solid modeling and applications
Revisiting decomposition analysis of geometric constraint graphs
Proceedings of the seventh ACM symposium on Solid modeling and applications
Solving Geometric Constraints By Homotopy
IEEE Transactions on Visualization and Computer Graphics
Variational geometry in computer-aided design
SIGGRAPH '81 Proceedings of the 8th annual conference on Computer graphics and interactive techniques
A correct rule-based geometric constraint solver
Computers and Graphics
Numerical decomposition of geometric constraints
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Geometric constraints solving: some tracks
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Spatial geometric constraint solving based on k-connected graph decomposition
Proceedings of the 2006 ACM symposium on Applied computing
Interrogating witnesses for geometric constraint solving
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Geometric constraint solving: The witness configuration method
Computer-Aided Design
Using invariance under the similarity group to solve geometric constraint systems
Computer-Aided Design
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
Computer-Aided Design
Detecting all dependences in systems of geometric constraints using the witness method
ADG'06 Proceedings of the 6th international conference on Automated deduction in geometry
Planar generalized stewart platforms and their direct kinematics
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Interrogating witnesses for geometric constraint solving
Information and Computation
| Hi-index | 0.00 |
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrained problem is reduced to the solving for smaller rigid bodies if possible. Second, we give the analytical solutions to one of the basic merge patterns used to solve a c-tree: the 3A3D general Stewart platform, which is to determine the position of a rigid body relative to another rigid body when we know three angular and three distance constraints between the two rigid bodies.