Series Parallel Linkages
James Cruickshank, Jonathan McLaughlin
TL;DR
This paper investigates the configuration spaces of series parallel linkages, providing an algorithm to determine their connectivity, which advances understanding of their geometric and combinatorial properties.
Contribution
It introduces a novel algorithm to decide connectivity of realization spaces for series parallel graph linkages.
Findings
Algorithm effectively determines connectivity of linkage spaces.
Connectivity depends on the structure of the underlying series parallel graph.
Results contribute to the understanding of geometric properties of linkage configuration spaces.
Abstract
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Structural Analysis and Optimization · Advanced Materials and Mechanics