Abstract

A theorem of Laman gives a combinatorial characterization of the graphs that admit a realization as a minimally rigid generic bar-joint framework in $\mathbb{R}^2$. A more general theory is developed for frameworks in $\mathbb{R}^3$ whose vertices are constrained to move on a two-dimensional smooth submanifold $\mathcal{M}$. Furthermore, when $\mathcal{M}$ is a union of concentric spheres, or a union of parallel planes, or a union of concentric cylinders, necessary and sufficient combinatorial conditions are obtained for the minimal rigidity of generic frameworks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.