• Corpus ID: 1401905


  author={Charles W. Wampler},
It is commonly recognized that a convenient formulation for problems in planar kinematics is obtained by considering links to be vectors in the complex plane. However, scant attention has been paid to the natural interpretation of complex vectors as isotropic coordinates. These coordinates, often considered a special trick for analyzing four-bar motion, are in fact uniquely suited to two new techniques for analyzing polynomial systems: the BKK bound and the product-decomposition bound. From… 

Figures from this paper

Solving the Kinematics of Planar Mechanisms by Dixon Determinant and a Complex-Plane Formulation

This paper presents a general method for the analysis of any planar mechanism consisting of rigid links connected by revolute and slider joints. The method combines the complex plane formulation of

Parallel Manipulators in Terms of Dual Cayley-Klein Parameters

Cayley-Klein parameters are an alternative to Euler parameters for describing the spherical motion group. Based on Study’s and Kotelnikov’s “Principle of Transference” one can use dual Cayley-Klein

Singular Foci of Planar Linkages

The geometry of singular foci of planar linkages

Finding Straight Line Generators through the Approximate Synthesis of Symmetric Four-bar Coupler Curves

In this paper, equations for the approximate synthesis of symmetric fourbar coupler curves are formulated. Our approach specifies a number of desired trace points, and finds a number of four-bar

Synthesis of Stephenson III Timed Curve Generators Using a Probabilistic Continuation Method

The Cyclic Coefficient Parameter Continuation (CCPC) method is applied to obtain for the first time the complete solution of a Stephenson III six-bar that traces a path and coordinates the angle of its input link along that path.

Synthesis of Six-Bar Timed Curve Generators of Stephenson-Type Using Random Monodromy Loops

The computation of nearly complete solution sets for these six-bar design equations has been facilitated by recent root finding techniques belonging to the field of numerical algebraic geometry, and the solution sets are reported to all relevant six-bars of the Stephenson topology.

Formulation and Solution for the Direct and Inverse Kinematics Problems for Mechanisms and Mechatronics Systems

The formulation of a kinematic analysis problem often leads to a set of nonlinear equations. There are a variety of both numerical and algebraic techniques available to solve such systems of

Numerical Homotopies to Compute Generic Points on Positive Dimensional Algebraic Sets

An embedding of the original polynomial system is presented, which leads to a sequence of homotopies, with solution paths leading to generic points of all components as the isolated solutions of an auxiliary system.



Coefficient-parameter polynomial continuation

A homotopy for solving general polynomial systems that respects m-homogeneous structures

Kinematic geometry of mechanisms

The components of mechanism freedom and structure in mechanism elementary planar and spatial displacements planar algebraic curves infinitesimal planar kinematics planar displacements through three

Homotopies exploiting Newton polytopes for solving sparse polynomial systems

The algorithm for computing the BKK bound for the number of isolated solutions of a polynomial system with a sparse monomial structure is described and the algorithmic construction of the cheater’s homotopy or the coefficienthomotopy is obtained.

Synthesis of Path-Generating Mechanisms by Numerical Methods

Algebraic methods in kinematic synthesis are extended to cases in which the development of iterative numerical procedures are required, and Convergence is obtained without the need for a “good” initial approximation.

Mixed-volume computation by dynamic lifting applied to polynomial system solving

A deterministic manipulation of the lifting for computing mixed volumes, which rules out randomness conditions is presented and the implications of dynamic lifting on polyhedral homotopy methods for the solution of polynomial systems are investigated.

A product-decomposition bound for Bezout numbers

Most polynomial systems that arise in practice are not completely general but have special structures. A common form is that each equation must be a sum of products, where each factor has an

A polyhedral method for solving sparse polynomial systems

Mixed subdivisions of Newton polytopes are introduced, and they are applied to give a new proof and algorithm for Bernstein's theorem on the expected number of roots, which results in a numerical homotopy with the optimal number of paths to be followed.

An Analytical Treatment of the 3‐Bar Curve

The number of roots of a system of equations