Discover and read the best of Twitter Threads about #siggraphasia2021
Most recents (1)
Excited to share *two* papers appearing at #SIGGRAPHAsia2021, on "Repulsive Curves" and "Repulsive Surfaces."
Tons of graphics algorithms find nice distributions of points by minimizing a "repulsive" energy.
But what if you need to nicely distribute curves or surfaces? (1/14)
Tons of graphics algorithms find nice distributions of points by minimizing a "repulsive" energy.
But what if you need to nicely distribute curves or surfaces? (1/14)
We take a deep dive into this question, building fast algorithms for optimizing the recently developed "tangent-point energy" from surface theory.
Talk video:
Repulsive Curves: cs.cmu.edu/~kmcrane/Proje…
Repulsive Surfaces: cs.cmu.edu/~kmcrane/Proje…
(2/14)
Talk video:
Repulsive Curves: cs.cmu.edu/~kmcrane/Proje…
Repulsive Surfaces: cs.cmu.edu/~kmcrane/Proje…
(2/14)
The basic problem? Given a collection of points, curves, or surfaces in space, find a well-distributed arrangement that avoids (self-)intersection.
To make things interesting, you also usually have some constraints—like: the geometry is contained inside a bunny!
(3/14)
To make things interesting, you also usually have some constraints—like: the geometry is contained inside a bunny!
(3/14)
