abstract

Routing Reconfigurations

Authors:

Rebecca Lin,

Wenzhong Yan,

Ankur Mehta,

Erik D DemaineAuthors Info & Claims

SCF Adjunct '24: Adjunct Proceedings of the 9th ACM Symposium on Computational Fabrication

Article No.: 14, Pages 1 - 3

https://doi.org/10.1145/3665662.3673255

Published: 30 July 2024 Publication History

Get Access

Abstract

We propose an approach to reconfiguration: routing string through a collection of geometric units so that pulling on different strings or groups of strings automatically (re-)arranges the units into distinct target configurations. We provide several strategies for smooth reconfiguration, including computing minimum-turn routings and optimizing the geometry of the units to reduce resistive force.

Supplemental Material

MP4 File

demo examples

Download
3.17 MB

MP4 File

demo examples

Download
7.97 MB

References

[1]

Zachary Abel, Erik D Demaine, Martin L Demaine, Sarah Eisenstat, Jayson Lynch, and Tao B Schardl. 2013. Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. Information and Media Technologies 8, 3 (2013), 685–694.

Google Scholar

[2]

James M Bern, Leonardo Zamora Yañez, Emily Sologuren, and Daniela Rus. 2022. Contact-Rich Soft-Rigid Robots Inspired by Push Puppets. In 2022 IEEE 5th International Conference on Soft Robotics (RoboSoft). IEEE, 607–613.

Crossref

Google Scholar

[3]

Erik D Demaine, Yael Kirkpatrick, and Rebecca Lin. 2024a. Graph Threading. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Schloss-Dagstuhl-Leibniz Zentrum für Informatik.

Google Scholar

[4]

Erik D Demaine, Yael Kirkpatrick, and Rebecca Lin. 2024b. Graph Threading with Turn Costs. arXiv preprint arXiv:2405.17953 (2024).

Google Scholar

[5]

John Edmark. 2016. Roll-Up Spiral. https://www.johnedmark.com/spirals1/2016/4/29/roll-up-spiral

Google Scholar

[6]

Martin Kilian, Aron Monszpart, and Niloy J Mitra. 2017. String Actuated Curved Folded Surfaces. ACM Transactions on Graphics (TOG) 36, 3 (2017), 1–13.

Digital Library

Google Scholar

[7]

Rebecca Lin and Tomohiro Tachi. 2024. Push Puppet-Inspired Deployable Structure. https://twitter.com/rebeccayelin/status/1749193197031469102

Google Scholar

[8]

Alison Martin. 2021. Optimization of Threading Paths. https://twitter.com/alisonmartin57/status/1461643652946698240

Google Scholar

[9]

Lingyun Sun, Jiaji Li, Yu Chen, Yue Yang, Zhi Yu, Danli Luo, Jianzhe Gu, Lining Yao, Ye Tao, and Guanyun Wang. 2021. Flextruss: A Computational Threading Method for Multi-Material, Multi-Form and Multi-Use Prototyping. In Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems. 1–12.

Digital Library

Google Scholar

[10]

Christopher Umans and William Lenhart. 1997. Hamiltonian Cycles in Solid Grid Graphs. In Proceedings 38th Annual Symposium on Foundations of Computer Science. IEEE, 496–505.

Crossref

Google Scholar

[11]

Wenzhong Yan, Talmage Jones, Christopher L Jawetz, Ryan H Lee, Jonathan B Hopkins, and Ankur Mehta. 2024. Self-Deployable Contracting-Cord Metamaterials with Tunable Mechanical Properties. (2024).

Google Scholar

Index Terms

Routing Reconfigurations
1. Applied computing
  1. Physical sciences and engineering
    1. Engineering
      1. Computer-aided design

Recommendations

Efficiently scheduling runtime reconfigurations

Due to the emergence of portable devices that must run complex dynamic applications there is a need for flexible platforms for embedded systems. Runtime reconfigurable hardware can provide this flexibility but the reconfiguration latency can ...
Improving network agility with seamless BGP reconfigurations

The network infrastructure of Internet service providers (ISPs) undergoes constant evolution. Whenever new requirements arise (e.g., the deployment of a new Point of Presence or a change in the business relationship with a neighboring ISP), operators ...
Optimal Placement-aware Trace-Based Scheduling of Hardware Reconfigurations for FPGA Accelerators
FCCM '09: Proceedings of the 2009 17th IEEE Symposium on Field Programmable Custom Computing Machines

Modern use of FPGAs as hardware accelerators involvesthe partial reconfiguration of hardware resources as the applicationexecutes. In this paper, we present a polynomial timealgorithm for scheduling reconfiguration tasks given atrace of actors (...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SCF Adjunct '24: Adjunct Proceedings of the 9th ACM Symposium on Computational Fabrication

July 2024

49 pages

ISBN:9798400706950

DOI:10.1145/3665662

Editors:
Michael Wessely
Aarhus University
,
Valkyrie Savage
University of Copenhagen
,
Piotr Didyk
Universita della Svizzera italiana
,
Jonas Martinez
Inria

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2024

Check for updates

Qualifiers

Abstract
Research
Refereed limited

Conference

SCF '24

Sponsor:

SCF '24: ACM Symposium on Computational Fabrication

July 7 - 10, 2024

Aarhus, Denmark

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
51
Total Downloads

Downloads (Last 12 months)51
Downloads (Last 6 weeks)10

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Abstract

Supplemental Material

References

Index Terms

Recommendations

Efficiently scheduling runtime reconfigurations

Improving network agility with seamless BGP reconfigurations

Optimal Placement-aware Trace-Based Scheduling of Hardware Reconfigurations for FPGA Accelerators

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

HTML Format

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations