Semiconfiguration Spaces of Planar Linkages
classification
🧮 math.GT
math.AG
keywords
compactsetsspacesassumingcharacterizescompactnesscomplexconfiguration
read the original abstract
This paper characterizes which subsets of C^n can be the set of positions of n points on a linkage in the complex plane C. For example, assuming compactness they are just compact semialgebraic sets. Noncompact configuration spaces are semialgebraics sets invariant under the Euclidean group, with compact quotient.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.