Tel-Aviv University - Computer Science Colloquium
Sunday, April 30, 14:15-15:15
at 14:00
Schreiber Building, Room 309
Fast Marching on Triangulated
Domains
Ron Kimmel
Computer Science Department, Technion
Abstract:
We introduce a computationally optimal
numerical answer to the question of how to compute the shortest
path between two points on a surface, also known as the `minimal
geodesic problem'. We extend a numerical technique for
solving Eikonal equations on flat domains to triangulated
curved domains. Next, we apply our method to solve the minimal
geodesic problem, and to compute Voronoi diagrams and offset
curves on surfaces. We also present applications of the
technique to areas like 3D shape reconstruction in computer vision
and path planning in robotic navigation.
Based on joint work with J.A. Sethian from U.C. Berkeley
For colloquium schedule, see
http://www.math.tau.ac.il/~zwick/colloq.html