37 citations · 82 across the 6 of their papers we have counts for
6 papers
A Novel Approach for Ellipsoidal Outer-Approximation of the Intersection Region of Ellipses in the Plane
Siamak Yousefi, Xiao-Wen Chang, Henk Wymeersch +2
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertice…
Cauchy's Arm Lemma on a Growing Sphere
Zachary Abel, David Charlton, Sebastien Collette +6
We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its en…
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
Justin Colannino, Mirela Damian, Ferran Hurtado +4
The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T, such that each point in S maps to exactly…
Locked and Unlocked Polygonal Chains in 3D
T. Biedl, E. Demaine, M. Demaine +8
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a stra…
On Reconfiguring Tree Linkages: Trees can Lock
Therese Biedl, Erik Demaine, Martin Demaine +7
It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfig…
Locked and Unlocked Polygonal Chains in 3D
T. Biedl, E. Demaine, M. Demaine +8
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a stra…