A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
From MaRDI portal
Publication:628146
Recommendations
- Well-constrained and under-constrained geometric constraint solving based on a D-tree decomposition
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
- GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING
- A 2D geometric constraint solver using a graph reduction method
- Tree-decomposable and underconstrained geometric constraint problems
Cited In (11)
- Classification of direct kinematics to planar generalized Stewart platforms
- GEOMETRICAL CONSTRAINT SYSTEM DECOMPOSITION: A MULTI-GROUP APPROACH
- GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
- Body-and-cad geometric constraint systems
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- Tracking topological changes in parametric models
- A formalization of geometric constraint systems and their decomposition
- WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS
- Well-constrained and under-constrained geometric constraint solving based on a D-tree decomposition
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
Uses Software
This page was built for publication: A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628146)