scientific article; zbMATH DE number 952952
From MaRDI portal
Publication:4717849
Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Chain complexes in algebraic topology (55U15) Numerical computation using splines (65D07) Computer science aspects of computer-aided design (68U07)
Cited in
(only showing first 100 items - show all)- Rooted \(k\)-connections in digraphs
- A sufficient connectivity condition for generic rigidity in the plane
- Rigid tensegrity labelings of graphs
- Sparse hypergraphs and pebble game algorithms
- On characterizations of rigid graphs in the plane using spanning trees
- On the rigidity of molecular graphs
- Chords and disjoint paths in matroids
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- A homological interpretation of skeletal ridigity
- Algorithms for detecting dependencies and rigid subsystems for CAD
- Configurations of lines in space and combinatorial rigidity
- Characterizing minimally flat symmetric hypergraphs
- Point-hyperplane frameworks, slider joints, and rigidity preserving transformations
- Equivalent realisations of a rigid graph
- Rigid cylindrical frameworks with two coincident points
- Foreword to special issue
- Combinatorial rigidity of incidence systems and application to dictionary learning
- Motions of grid-like reflection frameworks
- Biased positional games on matroids
- Planar minimally rigid graphs and pseudo-triangulations
- Connected rigidity matroids and unique realizations of graphs
- Enumerating pseudo-triangulations in the plane
- Discrete polymatroids
- When is a symmetric body-bar structure isostatic?
- Cellular morphogenesis of three-dimensional tensegrity structures
- Complexity of packing common bases in matroids
- Graph reconstruction from unlabeled edge lengths
- Assur decompositions of direction-length frameworks
- Sufficient conditions for the global rigidity of periodic graphs
- Extremal families of redundantly rigid graphs in three dimensions
- k-plane matroids and Whiteley's flattening conjectures
- Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
- Minimally globally rigid graphs
- Sufficient connectivity conditions for rigidity of symmetric frameworks
- Sparse graphs and an augmentation problem
- Globally rigid powers of graphs
- Triangular angle rigidity for distributed localization in 2D
- Coincident rigidity of 2-dimensional frameworks
- Global rigidity of direction-length frameworks
- Rigidity with few locations
- Rigidity of symmetric frameworks in normed spaces
- Graded sparse graphs and body-length-direction frameworks
- Generation of planar tensegrity structures through cellular multiplication
- Sparse hypergraphs with applications in combinatorial rigidity
- Rigid two-dimensional frameworks with two coincident points
- Sufficient conditions for the global rigidity of graphs
- Maxwell-Laman counts for bar-joint frameworks in normed spaces
- Inductive constructions for frameworks on a two-dimensional fixed torus
- Radically solvable graphs
- Global rigidity of triangulations with braces
- Finite motions from periodic frameworks with added symmetry
- Directed graphs, decompositions, and spatial linkages
- Some hard problems on matroid spikes
- Pebble game algorithms and sparse graphs
- Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
- The Dress conjectures on rank in the 3-dimensional rigidity matroid
- Rigid two-dimensional frameworks with three collinear points
- The d-dimensional rigidity matroid of sparse graphs
- Rigid realizations of graphs on small grids
- Maps of matroids with applications
- Gain-sparsity and symmetry-forced rigidity in the plane
- Rigid realizations of graphs with few locations in the plane
- Robust tracking control of bearing-constrained leader-follower formation
- Vertex splitting, coincident realisations, and global rigidity of braced triangulations
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Bipartite rigidity
- An inductive construction of minimally rigid body-hinge simple graphs
- Symmetry-forced rigidity of frameworks on surfaces
- An inductive construction of minimally rigid body-hinge simple graphs
- Stable camera motion estimation using convex programming
- Unique low rank completability of partially filled matrices
- Minimum cost globally rigid subgraphs
- Contact Graphs of Circular Arcs
- Matroids of gain graphs in applied discrete geometry
- Antistrong digraphs
- Combinatorial rigidity and independence of generalized pinned subspace-incidence constraint systems
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
- Linking rigid bodies symmetrically
- Generically globally rigid zeolites in the plane
- Boundedness, rigidity and global rigidity of direction-length frameworks
- Geometry of graph varieties
- Balanced generic circuits without long paths
- Body-and-cad geometric constraint systems
- Rigidity of frameworks on expanding spheres
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- A distributed continuous-time algorithm for network localization using angle-of-arrival information
- Periodic rigidity on a variable torus using inductive constructions
- Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations
- Strong algorithms for the ordinal matroid secretary problem
- The Steiner Problem for Count Matroids
- Sparse graphs and an augmentation problem
- Globally rigid augmentation of rigid graphs
- Frameworks with Coordinated Edge Motions
- Self-dual polyhedra of given degree sequence
- Rigidity percolation in disordered 3D rod systems
- A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs
- Globally rigid graphs are fully reconstructible
- Sufficient conditions for 2-dimensional global rigidity
- Globally linked pairs of vertices in rigid frameworks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717849)