On the Infinitesimal Rigidity of Bar-and-Slider Frameworks

DOI10.1007/978-3-642-10631-6_54zbMath1273.05225OpenAlexW1597987529MaRDI QIDQ3652240

Naoki Katoh, Shin-ichi Tanigawa

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_54

zbMATH Keywords

infinitesimal rigiditybar-joint frameworkbar-slider frameworkforest-partition theoremline-sliders

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items (3)

A rooted-forest partition with uniform vertex demand ⋮ On Maximal Independent Arborescence Packing ⋮ A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)

This page was built for publication: On the Infinitesimal Rigidity of Bar-and-Slider Frameworks