The following pages link to On Generic Rigidity in the Plane (Q3960720):
Displayed 46 items.
- Generically globally rigid zeolites in the plane (Q407570) (← links)
- Boundedness, rigidity and global rigidity of direction-length frameworks (Q408960) (← links)
- Highly connected molecular graphs are rigid in three dimensions (Q436325) (← links)
- Bounded direction-length frameworks (Q542392) (← links)
- A combinatorial study of the rigidity of planar structures (Q581093) (← links)
- Symmetric versions of Laman's theorem (Q603868) (← links)
- Slider-pinning rigidity: a Maxwell-Laman-type theorem (Q603881) (← links)
- A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection (Q792636) (← links)
- A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae (Q792637) (← links)
- Source location with rigidity and tree packing requirements (Q867918) (← links)
- Pin-collinear body-and-pin frameworks and the molecular conjecture (Q958222) (← links)
- Globally rigid circuits of the direction-length rigidity matroid (Q968450) (← links)
- Tensegrity frameworks in one-dimensional space (Q973096) (← links)
- Rigidity, global rigidity, and graph decomposition (Q973100) (← links)
- The parity problem of polymatroids without double circuits (Q987548) (← links)
- A sufficient connectivity condition for generic rigidity in the plane (Q1026167) (← links)
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- On characterizations of rigid graphs in the plane using spanning trees (Q1043809) (← links)
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications (Q1062429) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- On the two-dimensional generic rigidity matroid and its dual (Q1186124) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Applications of combinatorics to statics --- a second survey (Q1201249) (← links)
- Isostatic bar and joint frameworks in the plane with irreducible pure conditions (Q1337671) (← links)
- Metric graphs elastically embeddable in the plane (Q1352120) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- An algorithm for two-dimensional rigidity percolation: The pebble game (Q1375495) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Connected rigidity matroids and unique realizations of graphs (Q1775892) (← links)
- On the generic rigidity of bar-frameworks (Q1809519) (← links)
- Bending of surfaces. II (Q1912505) (← links)
- Graph rigidity via Euclidean distance matrices (Q1978125) (← links)
- On combinatorial structures of line drawings of polyhedra (Q2266021) (← links)
- Matroid matching with Dilworth truncation (Q2476281) (← links)
- Pebble game algorithms and sparse graphs (Q2476285) (← links)
- The Dress conjectures on rank in the 3-dimensional rigidity matroid (Q2490014) (← links)
- Rigid two-dimensional frameworks with three collinear points (Q2494111) (← links)
- The \(d\)-dimensional rigidity matroid of sparse graphs (Q2565690) (← links)
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs (Q2573645) (← links)
- Searching the solution space in constructive geometric constraint solving with genetic algorithms (Q2574087) (← links)
- OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS (Q3070043) (← links)
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY (Q3422212) (← links)
- ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID (Q3422213) (← links)
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— (Q3731772) (← links)
- Singular spaces of matrices and their application in combinatorics (Q4005434) (← links)
- Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method (Q5453487) (← links)