Meshes and Nets

Presented at CMU Theory Lunch, April 6, 2011

What is the difference between a mesh and a net?
What is the difference between a metric space epsilon-net and a range
space epsilon-net?
What is the difference between geometric divide-and-conquer and
combinatorial divide-and-conquer?

In this talk, I will answer these questions and discuss how these different ideas come together to finally settle the question of how to compute conforming point set meshes in optimal time. The meshing problem is to discretize space into as few pieces as possible and yet still capture the underlying density of the input points. Meshes are fundamental in scientific computing, graphics, and more recently, topological data analysis.

This is joint work with Gary Miller and Todd Phillips

In this talk, I will answer these questions and discuss how these different ideas come together to finally settle the question of how to compute conforming point set meshes in optimal time. The meshing problem is to discretize space into as few pieces as possible and yet still capture the underlying density of the input points. Meshes are fundamental in scientific computing, graphics, and more recently, topological data analysis.

This is joint work with Gary Miller and Todd Phillips