Algorithms for graph rigidity and scene analysis
DOI10.1007/B13632zbMATH Open1266.05162OpenAlexW1827234103MaRDI QIDQ5897236FDOQ5897236
Authors: Alex R. Berg, Tibor Jordán 
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Recommendations
- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs
- Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs
- An efficient algorithm for testing the generic rigidity of graphs in the plane
- scientific article; zbMATH DE number 1182943
- Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
algorithmbipartite graphsscene analysisgraph familiesedge counts\(M\)-connected componentd-sharp subgraphsd-tight bipartite graphsglobally rigid componentparallel drawingredundantly rigid componentrigid component
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62) Machine vision and scene understanding (68T45)
Cited In (46)
- Operations preserving the global rigidity of graphs and frameworks in the plane
- Gain-sparsity and symmetry-forced rigidity in the plane
- Rigid realizations of graphs on small grids
- Enumerating non-crossing minimally rigid frameworks
- Rigid cylindrical frameworks with two coincident points
- Rigid block and hole graphs with a single block
- Mixed volume techniques for embeddings of Laman graphs
- Minimum cost globally rigid subgraphs
- New upper bounds for the number of embeddings of minimally rigid graphs
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Bounded direction-length frameworks
- Enumerating combinatorial resultant trees
- A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space
- Rigid tensegrity labelings of graphs
- Rigid two-dimensional frameworks with three collinear points
- A rooted-forest partition with uniform vertex demand
- Globally rigid circuits of the direction-length rigidity matroid
- Equivalent realisations of a rigid graph
- Sparse graphs and an augmentation problem
- Sparse graphs and an augmentation problem
- Global rigidity of generic frameworks on the cylinder
- Recognizing planar Laman graphs
- The Steiner Problem for Count Matroids
- Necessary conditions for the generic global rigidity of frameworks on surfaces
- Connected rigidity matroids and unique realizations of graphs
- Rigidity for sticky discs
- Good orientations of unions of edge‐disjoint spanning trees
- Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs
- Enumerating constrained non-crossing minimally rigid frameworks
- Source location with rigidity and tree packing requirements
- Sparsity-certifying graph decompositions
- Sparse hypergraphs and pebble game algorithms
- Pebble game algorithms and sparse graphs
- Rigid two-dimensional frameworks with two coincident points
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Global rigidity of direction-length frameworks
- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs
- Fast enumeration algorithms for non-crossing geometric graphs
- Frameworks with Coordinated Edge Motions
- Globally linked pairs of vertices in rigid frameworks
- When is a planar rod configuration infinitesimally rigid?
- Cycle-based formulations in distance geometry
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)
- Analyzing rigidity with pebble games
- Exploring the rigidity of planar configurations of points and rods
- Rigidity, global rigidity, and graph decomposition
This page was built for publication: Algorithms for graph rigidity and scene analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897236)
