10 citations · 21 across the 7 of their papers we have counts for
8 papers
Combinatorial rigidity of Incidence systems and Application to Dictionary learning
Meera Sitharam, Mohamad Tarifi, Menghan Wang
Given a hypergraph with hyperedges and a set of \emph{pinning subspaces}, i.e.\ globally fixed subspaces in Euclidean space , a \emph{pinned subspace-…
Symmetry in Sphere-based Assembly Configuration Spaces
Meera Sitharam, Andrew Vince, Menghan Wang +1
Many remarkably robust, rapid and spontaneous self-assembly phenomena in nature can be modeled geometrically starting from a collection of rigid bunches of spheres. This paper high…
Optimal Decomposition and Recombination of Isostatic Geometric Constraint Systems for Designing Layered Materials
Troy Baker, Meera Sitharam, Menghan Wang +1
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning…
Combinatorial rigidity and independence of generalized pinned subspace-incidence constraint systems
Menghan Wang, Meera Sitharam
Given a hypergraph with hyperedges and a set of \emph{pins}, i.e.\ globally fixed subspaces in Euclidean space , a \emph{pinned subspace-incidence sys…
Cayley Analysis of Mechanism Configuration Spaces using CayMos: Software Functionalities and Architecture
Menghan Wang, Meera Sitharam
For a common class of 2D mechanisms called 1-dof tree decomposable linkages, we present a software CayMos which uses new theoretical results to implement efficient algorithmic solu…
An Incidence Geometry approach to Dictionary Learning
Meera Sitharam, Mohamad Tarifi, Menghan Wang
We study the Dictionary Learning (aka Sparse Coding) problem of obtaining a sparse representation of data points, by learning \emph{dictionary vectors} upon which the data points c…
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…