Algorithmic Search for Flexibility Using Resultants of Polynomial Systems

DOI10.1007/978-3-540-77356-6_5zbMath1195.68115OpenAlexW1584446371MaRDI QIDQ5453485

Evangelos A. Coutsias, Robert H. Lewis

Publication date: 1 April 2008

Published in: Automated Deduction in Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77356-6_5

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Computational methods for problems pertaining to biology (92-08)

Related Items (6)

Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems ⋮ Differential elimination with Dixon resultants ⋮ Flexibility of Bricard's linkages and other structures via resultants and computer algebra ⋮ Heuristics to accelerate the Dixon resultant ⋮ Comparing acceleration techniques for the Dixon and Macaulay resultants ⋮ Applications of an improved Dixon elimination method for the inverse kinematics of 6R manipulators

Uses Software

• Fermat

Cites Work

• Unnamed Item
• Unnamed Item
• A counterexample to the rigidity conjecture for polyhedra
• Generalized resultants over unirational algebraic varieties
• The proof of the ``bellows conjecture for polyhedra of low topological genus
• Heuristics to accelerate the Dixon resultant
• Resultants and loop closure
• Polyhedra with bendings and Riemann surfaces
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Higher order flexibility of octahedra

This page was built for publication: Algorithmic Search for Flexibility Using Resultants of Polynomial Systems