Using invariance under the similarity group to solve geometric constraint systems
From MaRDI portal
Publication:628158
Recommendations
- GEOMETRICAL CONSTRAINT SYSTEM DECOMPOSITION: A MULTI-GROUP APPROACH
- A systematic framework for solving geometric constraints analytically
- On the use of conformal geometric algebra in geometric constraint solving
- scientific article; zbMATH DE number 2080310
- Geometric constraint solving with conics and linkages
- A formalization of geometric constraint systems and their decomposition
Cited in
(5)- Global invariants of paths and curves for the group of all linear similarities in the two-dimensional Euclidean space
- Identifications of paths and curves under the plane similarity transformations and their applications to mechanics
- A formalization of geometric constraint systems and their decomposition
- Towards a better integration of modelers and black box constraint solvers within the product design process
- GEOMETRICAL CONSTRAINT SYSTEM DECOMPOSITION: A MULTI-GROUP APPROACH
This page was built for publication: Using invariance under the similarity group to solve geometric constraint systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628158)