Algorithms for graph rigidity and scene analysis
\(M\)-connected componentalgorithmbipartite graphsd-sharp subgraphsd-tight bipartite graphsedge countsglobally rigid componentgraph familiesparallel drawingredundantly rigid componentrigid componentscene analysis
Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Machine vision and scene understanding (68T45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
- 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
- Mixed volume techniques for embeddings of Laman graphs
- Rigid tensegrity labelings of graphs
- Sparse hypergraphs and pebble game algorithms
- Sparsity-certifying graph decompositions
- Equivalent realisations of a rigid graph
- Rigid cylindrical frameworks with two coincident points
- Connected rigidity matroids and unique realizations of graphs
- Rigid block and hole graphs with a single block
- Sparse graphs and an augmentation problem
- New upper bounds for the number of embeddings of minimally rigid graphs
- Global rigidity of direction-length frameworks
- Global rigidity of generic frameworks on the cylinder
- Rigid two-dimensional frameworks with two coincident points
- Enumerating non-crossing minimally rigid frameworks
- Pebble game algorithms and sparse graphs
- Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
- Rigid two-dimensional frameworks with three collinear points
- Rigid realizations of graphs on small grids
- Gain-sparsity and symmetry-forced rigidity in the plane
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Minimum cost globally rigid subgraphs
- Analyzing rigidity with pebble games
- An efficient algorithm for testing the generic rigidity of graphs in the plane
- Necessary conditions for the generic global rigidity of frameworks on surfaces
- The Steiner Problem for Count Matroids
- Sparse graphs and an augmentation problem
- Frameworks with Coordinated Edge Motions
- Recognizing planar Laman graphs
- Rigidity for sticky discs
- Globally linked pairs of vertices in rigid frameworks
- Bounded direction-length frameworks
- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs
- Fast enumeration algorithms for non-crossing geometric graphs
- Good orientations of unions of edge‐disjoint spanning trees
- A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space
- Exploring the rigidity of planar configurations of points and rods
- Cycle-based formulations in distance geometry
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Enumerating combinatorial resultant trees
- When is a planar rod configuration infinitesimally rigid?
- Elementary operations for rigidity restoration and persistence analysis of multi-agent system
- A rooted-forest partition with uniform vertex demand
- Source location with rigidity and tree packing requirements
- Operations preserving the global rigidity of graphs and frameworks in the plane
- Enumerating constrained non-crossing minimally rigid frameworks
- Globally rigid circuits of the direction-length rigidity matroid
- 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)
