October 27, 2017 from 16:00 to 18:00 (Montreal/EST time) On location
Algorithms for analyzing 3D surfaces find application in diverse fields from computer animation to medical imaging, manufacturing, and robotics. Reflecting a bias dating back to the early development of differential geometry, a disproportionate fraction of these algorithms focuses on discovering intrinsic shape properties, or those measurable along a surface without considering the surrounding space. This talk will summarize techniques to overcome this bias by developing a geometry processing pipeline that treats intrinsic and extrinsic geometry democratically. We describe theoreticallyjustified, stable algorithms that can characterize extrinsic shape from surface representations. In particular, we will show two strategies for computational extrinsic geometry. In our first approach, we will show how the discrete LaplaceBeltrami operator of a triangulated surface accompanied with the same operator for its offset determines the surface embedding up to rigid motion. In the second, we will treat a surface as the boundary of a volume rather than as a thin shell, using the Steklov (DirichlettoNeumann) eigenproblem as the basis for developing volumetric spectral shape analysis algorithms without discretizing the interior.
AddressUdeM, Pavillon André-Aisenstadt, room 6254