Abstract
Designing mechanical devices, called linkages, that draw a given plane curve has been a topic that interested engineers and mathematicians for hundreds of years, and recently also computer scientists. Already in 1876, Kempe proposed a procedure for solving the problem in full generality, but his constructions tend to be extremely complicated. We provide a novel algorithm that produces much simpler linkages, but works only for parametric curves. Our approach is to transform the problem into a factorization task over some noncommutative algebra. We show how to compute such a factorization, and how to use it to construct a linkage tracing a given curve.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 473-506 |
| Seitenumfang | 34 |
| Fachzeitschrift | Mathematics of Computation |
| Volume | 86 |
| Ausgabenummer | 303 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - Jän. 2017 |
Wissenschaftszweige
- 101 Mathematik
- 101001 Algebra
- 101005 Computeralgebra
- 101013 Mathematische Logik
- 102031 Theoretische Informatik
JKU-Schwerpunkte
- Computation in Informatics and Mathematics
- TNF Allgemein
Dieses zitieren
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver