Time

May 13 2008 - 3:30pm - 4:30 pm

Location

SM 3082

Speaker

Tamal Dey (OSU/dept of computer sciences)

Abstract

In recent years, algorithms have been proposed which can reconstruct a piecewise linear surface T from a dense point sample of a surface S with provable guarantees. In this talk I shall go over this development. We will present an algorithm called Cocone, its analysis for theoretical guarantees, and results of its implementation. If time permits, I shall mention about different extensions some of which are still part of active research.

Notes

After the talk of Gunnar Carlsson we realized that a number of researchers in the Dept of Computer Sciences have interests in (sometimes more) sophisticated topology. I have suggested prof. Tamal Dey to give a talk in the topology seminar to expose our colleagues and students to his work/problems. Dan Burghelea