Combinatorial rigidity of incidence systems and application to dictionary learning
From MaRDI portal
Publication:1745767
DOI10.1016/j.jsc.2018.02.003zbMath1390.68731arXiv1603.04109OpenAlexW2963796863MaRDI QIDQ1745767
Menghan Wang, Mohamad Tarifi, Sitharam, Meera
Publication date: 18 April 2018
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.04109
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Body-and-cad geometric constraint systems
- Slider-pinning rigidity: a Maxwell-Laman-type theorem
- Pin-collinear body-and-pin frameworks and the molecular conjecture
- Sparse hypergraphs and pebble game algorithms
- A matroid on hypergraphs, with applications in scene analysis and geometry
- Symbolic constraints in constructive geometric constraint solving
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
- Pebble game algorithms and sparse graphs
- ON AFFINE RIGIDITY
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- The Algebraic Geometry of Stresses in Frameworks
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- The Algebraic Geometry of Motions of Bar-and-Body Frameworks
- The Rigidity of Graphs
- Atomic Decomposition by Basis Pursuit
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Combinatorial Conditions for the Unique Completability of Low-Rank Matrices
- The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
- Compressed sensing
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- Decomposition plans for geometric constraint problems. II: New algorithms