4 citations · 4 across the 4 of their papers we have counts for
6 papers
Nucleation-free independent graphs with implied nonedges
Jialong Cheng, Meera Sitharam, Ileana Streinu +1
We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the construct…
Graphs with single interval Cayley configuration spaces in 3-dimensions
William Sims, Meera Sitharam
We prove a conjectured graph theoretic characterization of a geometric property of 3 dimensional linkages posed 15 years ago by Sitharam and Gao, motivated by their equivalent char…
Edge-length preserving embeddings of graphs between normed spaces
Sean Dewar, Eleftherios Kastis, Derek Kitson +1
The concept of graph flattenability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces…
Angular constraints on planar frameworks
Sean Dewar, Georg Grasegger, Anthony Nixon +4
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of directi…
Flip Paths Between Lattice Triangulations
William Sims, Meera Sitharam
We present a -time algorithm for the \emph{shortest (diagonal) flip path problem} for \emph{lattice} triangulations with points, improving over previous $O(…
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…