Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
From MaRDI portal
Recommendations
Cites work
- A counterexample to the rigidity conjecture for polyhedra
- Generalized resultants over unirational algebraic varieties
- Heuristics to accelerate the Dixon resultant
- Higher order flexibility of octahedra
- scientific article; zbMATH DE number 1263399 (Why is no real title available?)
- scientific article; zbMATH DE number 1026567 (Why is no real title available?)
- Polyhedra with bendings and Riemann surfaces
- Resultants and loop closure
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The proof of the ``bellows conjecture for polyhedra of low topological genus
Cited in
(7)- Applications of an improved Dixon elimination method for the inverse kinematics of 6R manipulators
- Flexibility of Bricard's linkages and other structures via resultants and computer algebra
- Heuristics to accelerate the Dixon resultant
- Algebraic algorithms for structure determination in biological chemistry
- Differential elimination with Dixon resultants
- Dixon-EDF: the premier method for solution of parametric polynomial systems
- Comparing acceleration techniques for the Dixon and Macaulay resultants
This page was built for publication: Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453485)