scientific article
From MaRDI portal
Publication:3334528
zbMath0545.51017MaRDI QIDQ3334528
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Composite and mixture properties (74E30) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Related Items
Globally Rigid Augmentation of Rigid Graphs ⋮ Which graphs are rigid in \(\ell_p^d\)? ⋮ Frameworks with Coordinated Edge Motions ⋮ A geometric lower bound theorem ⋮ Skeletal rigidity of simplicial complexes. I ⋮ Unique low rank completability of partially filled matrices ⋮ Rigidity of Frameworks on Expanding Spheres ⋮ Bipartite Rigidity ⋮ A characterization of homology manifolds with \(g_{2}\geq 2\) ⋮ New upper bounds for the number of embeddings of minimally rigid graphs ⋮ Globally rigid graphs are fully reconstructible ⋮ A characterization of simplicial polytopes with \(g_{2}=1\) ⋮ Flexible circuits in the d‐dimensional rigidity matroid ⋮ On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\) ⋮ The orbit rigidity matrix of a symmetric framework ⋮ Directed graphs, decompositions, and spatial linkages ⋮ Invariant computations for analytic projective geometry ⋮ The rigidity of the graphs of homology spheres minus one edge ⋮ Global rigidity: The effect of coning ⋮ Coning, symmetry and spherical frameworks ⋮ A note on generic rigidity of graphs in higher dimension ⋮ Rigidity and the lower bound theorem. I ⋮ On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs ⋮ Bipartite rigidity ⋮ On minimally highly vertex-redundantly rigid graphs ⋮ Graph reconstruction from unlabeled edge lengths ⋮ Double-distance frameworks and mixed sparsity graphs ⋮ Algebraic Matroids in Action ⋮ On the generic rigidity of bar-frameworks ⋮ Extremal families of redundantly rigid graphs in three dimensions ⋮ A homological interpretation of skeletal ridigity ⋮ Global rigidity of generic frameworks on the cylinder ⋮ Minimally globally rigid graphs ⋮ An asymptotic upper bound for graph embeddings
