Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs

DOI10.1007/11589440_3MaRDI QIDQ5449751zbMATH OpenOpenAlexFDO

Authors Sergey Bereg

Publication date 18 March 2008

Published in Discrete and Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11589440_3

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
• Rigidity Matroids
• The d-dimensional rigidity matroid of sparse graphs
• Algorithms for graph rigidity and scene analysis
• ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID

Cited in

(11)

• Natural realizations of sparsity matroids
• Computing Circuit Polynomials in the Algebraic Rigidity Matroid
• Algebraic graph theory for sparse flexibility matrices
• Enumerating combinatorial resultant trees
• Constant-time algorithms for sparsity matroids
• Cuts, matrix completions and graph rigidity
• Algorithms for graph rigidity and scene analysis
• Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
• Sparsity-certifying graph decompositions
• The d-dimensional rigidity matroid of sparse graphs
• Subspace arrangements, graph rigidity and derandomization through submodular optimization

This page was built for publication: Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449751)