research
∙
02/19/2022
Sorting Balls and Water: Equivalence and Computational Complexity
Various forms of sorting problems have been studied over the years. Rece...
share
research
∙
12/21/2020
Efficient Segment Folding is Hard
We introduce a computational origami problem which we call the segment f...
research
∙
01/24/2020
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
Given n points in the plane, we propose algorithms to compile connected ...
research
∙
03/19/2018