Algorithms for Generalized Signed Distance and Winding Numbers
PhD Thesis
Recorded talk
Abstract
This thesis presents algorithms for generalized inside/outside computation (via winding numbers) and signed distance computation. By "generalized", I mean that these algorithms make geometric inferences from imperfect data comprising incomplete, inaccurate, or ambiguous observations or representations of shapes. In other words, these algorithms generalize from imperfect data and implicitly approximate the true underlying curve or surface. A theme is that generalization can often be achieved by processing globally-defined functions encoding the geometry of interest, rather than the original, defective curve or surface. For both inside/outside and signed distance computation we can unlock further control over geometry and topology by processing higher-order derivatives of these functions. In many cases, we can also re-cast our algorithms, formulated in terms of smooth functions, onto different discretizations and geometric data structures. Another theme is that inside/outside and signed distance computation are closely related problems; towards this end, we provide a formalization of their relationship that justifies the design of our algorithms.
Thesis Fast Forward
My thesis was also featured in the 2026 ACM SIGGRAPH Thesis Fast Forward.
Cake
This amazing and delicious cake was made by my wonderful labmates Zoë Marschner, Olga Guțan, Hossein Baktash, and Jiří Minarčík.
