We present a new algorithm for unfolding planar polyg-onal linkages without self-intersection based on following the gradient flow of a “repulsive ” energy function. This algorithm has several advantages over previous methods. (1) The output motion is represented explicitly and exactly as a piecewise-linear curve in angle space. As a consequence, an exact snapshot of the linkage at any time can be extracted from the output in strongly polynomial time (on a real RAM supporting arithmetic, sin, and arcsin). (2) Each linear step of the motion can be computed exactly in O(n2) time on a real RAM where n is the number of vertices. (3) We explic-itly bound the number of linear steps (and hence the running time) as a polynomial in n and the ratio b...
We study the motion of polygonal linkages under the restriction that the angles between adjacent edg...
We prove new structural properties for tree-decompositions of planar graphs that we use to improve u...
This paper describes an algorithm for generating a guaranteedintersection-free interpolation sequenc...
We present a new algorithm for unfolding planar polygonal link-ages without self-intersection based ...
Abstract. Designing mechanical devices, called linkages, that draw a given plane curve has been a to...
Abstract. Designing mechanical devices, called linkages, that draw a given plane curve has been a to...
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basi...
This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequen...
This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequen...
A multi-loop linkage can be viewed as a graph of kinematic con-strain ts, and its solution entails n...
In this paper we are concerned with motions for untangling polygonal linkages (chains, polygons and ...
Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500’s [Dür77], ...
The results of this thesis concern folding of one-dimensional objects in two dimensions: planar link...
In this paper, we present an algorithm that automatically creates the linkage loop equations for pla...
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a n...
We study the motion of polygonal linkages under the restriction that the angles between adjacent edg...
We prove new structural properties for tree-decompositions of planar graphs that we use to improve u...
This paper describes an algorithm for generating a guaranteedintersection-free interpolation sequenc...
We present a new algorithm for unfolding planar polygonal link-ages without self-intersection based ...
Abstract. Designing mechanical devices, called linkages, that draw a given plane curve has been a to...
Abstract. Designing mechanical devices, called linkages, that draw a given plane curve has been a to...
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basi...
This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequen...
This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequen...
A multi-loop linkage can be viewed as a graph of kinematic con-strain ts, and its solution entails n...
In this paper we are concerned with motions for untangling polygonal linkages (chains, polygons and ...
Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500’s [Dür77], ...
The results of this thesis concern folding of one-dimensional objects in two dimensions: planar link...
In this paper, we present an algorithm that automatically creates the linkage loop equations for pla...
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a n...
We study the motion of polygonal linkages under the restriction that the angles between adjacent edg...
We prove new structural properties for tree-decompositions of planar graphs that we use to improve u...
This paper describes an algorithm for generating a guaranteedintersection-free interpolation sequenc...