Pages that link to "Item:Q3990103"

The following pages link to Conditions for Unique Graph Realizations (Q3990103):

Displaying 42 items.

• Minimally globally rigid graphs (Q2107492) (← links)
• Sparse graphs and an augmentation problem (Q2118121) (← links)
• Globally rigid powers of graphs (Q2131861) (← links)
• Sign rigidity theory and application to formation specification control (Q2139401) (← links)
• Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
• Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
• Generically globally rigid graphs have generic universally rigid frameworks (Q2182252) (← links)
• LRA: local rigid averaging of stretchable non-rigid shapes (Q2193872) (← links)
• Prescribed performance distance-based formation control of multi-agent systems (Q2207215) (← links)
• Global rigidity of periodic graphs under fixed-lattice representations (Q2221925) (← links)
• Angle-based shape determination theory of planar graphs with application to formation stabilization (Q2280678) (← links)
• Global rigidity of generic frameworks on the cylinder (Q2338637) (← links)
• Sufficient conditions for the global rigidity of graphs (Q2347845) (← links)
• Characterizing graphs with convex and connected Cayley configuration spaces (Q2380778) (← links)
• Global rigidity of triangulations with braces (Q2421558) (← links)
• On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) (← links)
• Pebble game algorithms and sparse graphs (Q2476285) (← links)
• Towards a better integration of modelers and black box constraint solvers within the product design process (Q2631961) (← links)
• Generalised rigid body motions in non-Euclidean planes with applications to global rigidity (Q2672986) (← links)
• Vertex splitting, coincident realisations, and global rigidity of braced triangulations (Q2679602) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Addressing agent loss in vehicle formations and sensor networks (Q2928292) (← links)
• On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)
• OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS (Q3070043) (← links)
• Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
• Finite time distributed distance‐constrained shape stabilization and flocking control for <i>d</i> ‐dimensional undirected rigid formations (Q3187903) (← links)
• Stable Camera Motion Estimation Using Convex Programming (Q3192651) (← links)
• Minimum Cost Globally Rigid Subgraphs (Q3295269) (← links)
• Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization (Q3295273) (← links)
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY (Q3422212) (← links)
• INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH (Q3422215) (← links)
• On the robustness to multiple agent losses in 2D and 3D formations (Q3458633) (← links)
• Self-dual polyhedra of given degree sequence (Q5058165) (← links)
• Globally rigid graphs are fully reconstructible (Q5093811) (← links)
• GENERIC UNLABELED GLOBAL RIGIDITY (Q5226556) (← links)
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD (Q5933499) (← links)
• Corrigendum to ‘flexible circuits in the d $d$‐dimensional rigidity matroid’ (Q6074581) (← links)
• Redundantly globally rigid braced triangulations (Q6094177) (← links)
• Exploring the rigidity of planar configurations of points and rods (Q6103477) (← links)
• Sharp threshold for rigidity of random graphs (Q6135068) (← links)
• Four-regular graphs with extremal rigidity properties (Q6197698) (← links)
• Global Rigidity of Line Constrained Frameworks (Q6202752) (← links)