10 citations · 19 across the 4 of their papers we have counts for
4 papers · 1 filter
Cayley Configuration Spaces of 1-dof Tree-decomposable Linkages, Part II: Combinatorial Characterization of Complexity
Meera Sitharam, Menghan Wang, Heping Gao
We continue to study Cayley configuration spaces of 1-dof linkages in 2D begun in Part I of this paper, i.e. the set of attainable lengths for a non-edge. In Part II, we focus on t…
Cayley Configuration Spaces of a Common Class of Mechanisms in Two Dimensions
Meera Sitharam, Menghan Wang, William Sims +1
We study Cayley configuration spaces of a class of 1 degree-of-freedom linkages (graphs with specified edge lengths), obtained by dropping an edge from a tree-decomposable graph. T…
Characterizing 1-Dof Henneberg-I graphs with efficient configuration spaces
Heping Gao, Meera Sitharam
We define and study exact, efficient representations of realization spaces of a natural class of underconstrained 2D Euclidean Distance Constraint Systems(EDCS) or Frameworks based…
Characterizing graphs with convex and connected configuration spaces
Meera Sitharam, Heping Gao
We define and study exact, efficient representations of realization spaces Euclidean Distance Constraint Systems (EDCS), which includes Linkages and Frameworks. Each representation…