BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Finding the optimal nets for self-folding Kirigami
- Nuno Araujo (Universidade de Lisboa)
DTSTART;TZID=Europe/London:20190206T172000
DTEND;TZID=Europe/London:20190206T184000
UID:TALK119815AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/119815
DESCRIPTION:Three-dimensional shells can be synthesized from t
he spontaneous self-folding of twodimensional temp
lates of interconnected panels\, called nets. Howe
ver\, some nets are more likely to self-fold into
the desired shell under random movements. The opti
mal nets are the ones that maximize the number of
vertex connections\, i.e.\, vertices that have onl
y two of its faces cut away from each other in the
net. Previous methods for finding such nets are b
ased on random search and thus do not guarantee th
e optimal solution. We proposed a deterministic pr
ocedure [1]. Our method allows not only to design
the self-assembly of much larger shell structures
but also to apply additional design criteria\, as
a complete catalog of the nets with the maximum nu
mber of vertex connections is obtained.
[1] N.
A. M. Araú\;jo\, R. A. da Costa\, S. N. Doro
govtsev\, J. F. F. Mendes\, Physical Review Letter
s
120\, 188001 (2018).
LOCATION:Seminar Room 2\, Newton Institute
CONTACT:INI IT
END:VEVENT
END:VCALENDAR