Graph Threading ITCS 2024
How can we thread tubes with a single string to achieve the desired structure when pulled taut? We present a polynomial-time algorithm for computing minimum-length threadings via a graph-theoretic perspective.
I am an EECS PhD student at MIT, advised by Erik Demaine in CSAIL and Zach Lieberman at the Media Lab. My research has been recognized and generously supported by the MIT MAD Design Fellowship, the NSERC Postgraduate Scholarship, and the MIT Stata Family Presidential Fellowship.
I develop mathematical abstractions and computational tools to support expressivity in art, design, and fabrication.
My time is devoted in equal parts to research, art, and teaching.
Research
Encoding-Decoding Constellation Patterns
How can we create constellations with unconventional star arrangements? We propose a method that automatically generates constellations from graph-based descriptions, using circle packings as scaffolding.
Gallery
Exhibitions
- 2025 Mathematical Art Exhibition, Group Exhibition, MathFest, Sacramento, CA
- 2025 "Code as Canvas", Group Exhibition, G.MAP, Gwangju, South Korea
- 2025 Mathematical Art Exhibition, Bridges, Eindhoven, Netherlands
- 2025 "Future Type", Group Exhibition, MIT Museum, Cambridge, MA
- 2025 "Intersections", Group Exhibition, Seattle Universal Math Museum & Mercer Island Visual Arts League, Mercer Island, WA
- 2025 Mathematical Art Exhibition, Group Exhibition, Joint Mathematics Meetings, Seattle, WA Honorable Mention
Teaching
- Spring 2025 MIT: Design and Analysis of Algorithms (20 hours/week)
- Fall 2024 MIT: Design and Analysis of Algorithms (20 hours/week)
- Spring 2024 MIT: Design and Analysis of Algorithms (20 hours/week)
- Fall 2023 MIT: Fundamentals of Programming (20 hours/week)
- Summer 2021 UBC: Intermediate Algorithm Analysis and Design (12 hours/week)
- Fall 2020 UBC: Basic Algorithms and Data Structures (12 hours/week)