Jack Snoeyink

Jack Snoeyink
Name	Jack Snoeyink
Birth place	Ottawa, Ontario, Canada
Fields	Computational Geometry, Topology, Algorithms
Workplaces	University of Illinois Urbana–Champaign; Bell Laboratories
Alma mater	University of Waterloo; University of Minnesota
Doctoral advisor	David G. Kirkpatrick
Known for	Computational topology, geometric algorithms, surface reconstruction

Jack Snoeyink is a Canadian-born computer scientist known for foundational work in computational geometry, computational topology, and geometric algorithms. His research spans algorithmic theory and practical techniques for modeling shapes, analyzing spatial data, and reconstructing surfaces from point samples. Snoeyink has held faculty positions and industry research appointments, contributing to applied projects and theoretical advances that influenced computational geometry, computer graphics, and geographic information systems.

Early life and education

Snoeyink was born in Ottawa and raised in Canada, where he pursued undergraduate studies at the University of Waterloo, linking early interests in algorithmic problems with peers in the Canadian computing community such as researchers from the David R. Cheriton School of Computer Science. He completed graduate studies at the University of Minnesota under the supervision of David G. Kirkpatrick, producing a doctoral dissertation on problems at the intersection of computational geometry and graph theory. During his formative years he interacted with colleagues and mentors from institutions like the International Olympiad in Informatics coaching community and the North American research network that included scholars from Carnegie Mellon University and MIT.

Academic career

Snoeyink joined the faculty at the University of Illinois Urbana–Champaign where he worked within departments and centers that collaborate with groups from Bell Laboratories, Microsoft Research, and the National Science Foundation. At Illinois he taught courses intersecting topics related to Stanford University-style curricula, advised graduate students, and co-supervised projects with visiting researchers from institutions such as the University of California, Berkeley and Princeton University. He also spent time in industry research environments, including a stint at Bell Laboratories, collaborating with engineers and scientists linked to projects involving Lucent Technologies-era research and partnerships with organizations like NASA on spatial data problems. Snoeyink organized sessions and tutorials at conferences hosted by the Association for Computing Machinery and the IEEE.

Research contributions

Snoeyink made influential contributions to algorithmic topology, including work on persistent homology-related techniques that connect to research from groups at Stanford University and ETH Zurich. He developed and co-developed algorithms for surface reconstruction and triangulation that tied into earlier and contemporary work by researchers from Brown University, Duke University, and the University of British Columbia. His papers addressed challenges in Delaunay triangulations, alpha shapes, and Voronoi diagrams, building on concepts associated with scholars from Georgia Institute of Technology and Tel Aviv University.

His collaborations yielded methods for contour trees, merge trees, and topological simplification used in visualization pipelines produced by teams at Los Alamos National Laboratory and the Lawrence Berkeley National Laboratory. Snoeyink contributed algorithms for point cloud processing and meshing that interfaced with implementations from research groups at Princeton University and industrial teams at Google and IBM. He worked on geometric data structures and query algorithms that related to classic results from Eugene W. Myers-adjacent computational biology groups and applied computational topology approaches relevant to researchers at Harvard University and Yale University.

Snoeyink co-authored papers with notable figures in computational geometry, partnering with scientists connected to the Symposium on Computational Geometry and the ACM Symposium on Theory of Computing. His research often bridged discrete and continuous perspectives, influencing applied work in computer graphics labs at Cornell University and simulation groups at Sandia National Laboratories.

Awards and honors

Snoeyink received recognition from professional societies and conference committees, including invited talks and best-paper distinctions at venues associated with the Association for Computing Machinery and the IEEE Computer Society. He held visiting appointments and fellowships that connected him to academic centers such as EPFL and Imperial College London. His mentorship and service were acknowledged through departmental awards and invitations to serve on program committees for flagship conferences like the International Symposium on Computational Geometry and workshops sponsored by the National Science Foundation.

Selected publications

- Snoeyink, J.; co-authors. "Algorithms for Surface Reconstruction from Unorganized Points," proceedings of the Symposium on Computational Geometry. - Snoeyink, J.; co-authors. "Contour Trees and Topological Simplification for Scientific Visualization," presented at the IEEE Visualization conference. - Snoeyink, J.; co-authors. "Efficient Algorithms for Delaunay Triangulation and Alpha Shapes," published in a collection associated with the ACM geometry community. - Snoeyink, J.; co-authors. "Topological Methods for Geometric Data Analysis," in workshop proceedings co-sponsored by the National Science Foundation and research labs from Lawrence Livermore National Laboratory. - Snoeyink, J.; co-authors. "Point Cloud Meshing and Noise-Resilient Reconstruction," in a special issue connected to the Computer Graphics Forum.

Category:Canadian computer scientists Category:Computational geometers