Discrete and computational geometry

I am also engaging in research problems with computer scientists in computational geometry. This work mostly involved convex optimization and path planning. The most interesting contribution was on finding geometric flows via dual programs. This introduced an idea using potentials, which has also played a significant role in my research on continuous modulus. 

The goal with this research is to develop algorithms for discrete and geometric problems, and to study the efficient computability of various geometric problems. This is also an area that is excellent for undergraduate research. If you would be interested to study algorithmic problems involving games and geometry, feel free to contact me.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: