| |
|
| |
|
Benoit Hudson
University Talk
Sparse Mesh Refinement
November 14, 2006 12:30
Abstract:
Groups of us at CMU have developed an algorithm for tetrahedral mesh generation, dubbed Sparse Voronoi Refinement (SVR). SVR has the following two features which have never both been provided before in a single algorithm: (1) it produces a quality, simplicial mesh in any fixed dimension that conforms to the input features; (2) it runs in output-sensitive O(m + n lg n) time (with caveats) in any fixed dimension. The talk will discuss the algorithm and its runtime proof. Assuming I haven't run over time, I'll continue and discuss the work that brings me back to TTI: adapting the algorithm to the dynamic setting.
If you have questions, or would like to meet the speaker, please contact Ponda at 4-1994 or pondabarnes@tti-c.org. For information on future TTI-C talks or events, please go to the TTI-C Events page.