Series parallel linkages

dc.contributor.author	Cruickshank, J.
dc.contributor.author	McLaughlin, J.
dc.date.accessioned	2018-09-20T16:04:29Z
dc.date.available	2018-09-20T16:04:29Z
dc.date.issued	2011-07-01
dc.identifier.citation	Cruickshank, J. McLaughlin, J. (2011). Series parallel linkages. Publicacions Matemàtiques 55 (2), 359-378
dc.identifier.issn	0214-1493
dc.identifier.uri	http://hdl.handle.net/10379/10968
dc.description.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.
dc.publisher	Universitat Autonoma de Barcelona
dc.relation.ispartof	Publicacions Matemàtiques
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Ireland
dc.rights.uri	https://creativecommons.org/licenses/by-nc-nd/3.0/ie/
dc.subject	linkage
dc.subject	series parallel graph
dc.subject	realisation
dc.subject	configuration space
dc.subject	moduli space
dc.subject	recognition
dc.subject	polygons
dc.subject	spaces
dc.subject	graphs
dc.subject	plane
dc.title	Series parallel linkages
dc.type	Article
dc.identifier.doi	10.5565/publmat_55211_05
dc.local.publishedsource	http://arxiv.org/pdf/0911.5293.pdf
nui.item.downloads	0

Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Ireland