VisLunch/Spring2010

From VistrailsWiki
Revision as of 18:40, 27 January 2010 by Chengu (talk | contribs)
Jump to navigation Jump to search

This semester Guoning Chen and Josh Levine will be responsible
for organizing the VisLunch sessions. Please feel free to contact them
for any question regarding VisLunch or for scheduling a talk:

Information regarding the VisLunch sessions will posted on this wiki page (http://www.vistrails.org/index.php/VisLunch/Spring2010)

Open Discussion and Semester Planning

Hello everyone! VisLunch is back for this semester. VisLunch provides you (graduate students, potdocs, faculties) a platform to present your research work or the latest development in the community that you think could benefit the rest of us. Also, you can benefit from the comments and suggestions on your presentation. Therefore, please let Josh and me know if

1) You submitted your work to a research venue (e.g. Siggraph2010) and would like to share your ideas;

2) You are preparing a submission to the upcoming venue (e.g. Vis2010, SGP, etc.) and would like to get some feedback or help;

3) You are going to present your work in a venue and need some feedback or help of your talk;

or 4) You recently read a new publication and are fascinated by the ideas and wish to share them with the rest of us;


Feb. 12, 2010

- Applying Manifold Learning to Plotting Approximate Contour Trees (VIS paper discussion)

- Speaker: Hao Wang (SCI), http://www.cs.utah.edu/~haow/


- ?? (VIS paper discussion)

- Speaker: Claurissa Tuttle (SCI) http://www.sci.utah.edu/people/tuttle.html

- Where: Conference Room 3760

- When: Friday noon (02/12)


Feb. 5, 2010

- Fiedler Trees for Multiscale Surface Analysis

In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the Fiedler vector of the Laplace-Beltrami operator to recursively decompose the surface. For this reason, we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and equi-areal surface patches, and noise robustness. We illustrate how the hierarchical patch decomposition may be exploited for generating multiresolution high quality uniform and adaptive meshes, as well as being a natural means for carrying out wavelet methods.

- Speaker: Matt Berger (SCI), http://www.sci.utah.edu/people/bergerm.html

- Where: Conference Room 3760

- When: Friday noon (02/05)