Doctoral Speaking Skills Talk - Nicole Feng March 7, 2025 9:30am — 10:30am Location: In Person - Traffic21 Classroom, Gates Hillman 6501 Speaker: NICOLE FENG, Ph.D. Student, Computer Science Department, Carnegie Mellon University https://nzfeng.github.io/ Algorithms for geometric problems enable modeling and simulation of the world around us — but they often break down on real-world geometric data comprising noisy, incomplete, or inaccurate observations or representations of shapes. These imperfections, along with the ever-increasing heterogenity of geometric data, require algorithms for robust geometry processing: versatile algorithms that work reliably across varying degrees of quality of their input. I'll demonstrate that the requisite robustness and versatility can be achieved by processing smooth, globally-defined functions encoding the geometry of interest. Moreover, we can unlock further control over geometry and topology by processing higher-order derivatives of functions. As examples, I'll present algorithms for curve and surface reconstruction, and signed distance computation. Presented in Partial Fulfillment of the CSD Speaking Skills Requirement Add event to Google Add event to iCal
