Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Wednesday, June 15, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Edgar Ramos (Univ. of Illinois at Urbana-Champaign)

Manifold Reconstruction from Point Samples

I describe an algorithm to 'reconstruct' a smooth k-dimensional manifold M embedded in an Euclidean space Rd from a 'sufficiently dense' point sample from the manifold. The algorithm outputs a simplicial manifold that is homeomorphic and geometrically close to M. The running time is O(n log n) where n is the number of points in the sample - the multiplicative constant depends exponentially on the dimension though.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login