I am a researcher and software engineer primarily specializing in computational geometry and graph algorithms. I am especially interested in problems and techniques lying at the intersection of the two.
I have previously worked in industry on production systems for high-dimensional approximate nearest-neighbour problems, FPGA middleware, and low-level distributed robotics graph-compute systems.
Works
Preprints
The Presort Hierarchy for Geometric Problems
Ivor van der Hoog, Eva Rotenberg, Jack S-J, Lasse Wulf arXiv, 2026
Subquadratic Approximation Algorithms for Separating Two Points[...]
Jayson Lynch, Jack S-J arXiv, 2025Recently updated (Feb 13)!
Reweighted Spectral Partitioning Works[...]
Jack S-J arXiv, 2025
Conference Papers
Greedy Heuristics and Simulated Annealing for Median Triangulation[...]
Jacobus Conradi, Benedikt Kolbe, Philip Mayer, Jonas Sauer, Jack S-J SoCG, 2026Paper accepted based on CG:SHOP competition results. No preprint available yet.
Separating Two Points with Obstacles in the Plane[...]
Jack S-J, Anurag Murty Naredla ESA, 2025
Contiguous Art Gallery and Related Problems[...]
Ahmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph S.B. Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Thomas Shermer, Jack S-J, Rolf Svenning, Da Wei Zheng SoCG, 2025Combined paper including "Analytic Arc Cover Problem"
Morphing Planar Graph Drawings[...]
Therese Biedl, Anna Lubiw, Jack S-J GD, 2024
Slant is NP-complete[...]
Jayson Lynch, Jack S-J CCCG, 2024
Carving Polytopes[...]
Eliot W. Robson, Jack S-J, Da Wei Zheng CCCG, 2024
CBLS for Min Partition into Plane Subgraphs[...]
Jack S-J, Brandon Zhang, Da Wei Zheng SoCG, 2022
Coordinated Motion Planning[...]
Paul Liu, Jack S-J, Brandon Zhang, Da Wei Zheng SoCG, 2021
Computing Low-Cost Convex Partitions[...]
Da Wei Zheng, Jack S-J, Brandon Zhang SoCG, 2020
Angle Covers[...]
William Evans, Ellen Gethner, Jack S-J, Alexander Wolff WALCOM, 2020
Journal Papers
Conflict Optimization for Binary CSP[...]
Loïc Crombez, Guilherme D. da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack S-J, Brandon Zhang, Da Wei Zheng ACM JEA, 2023
Coordinated Motion Planning[...]
Paul Liu, Jack S-J, Brandon Zhang, Da Wei Zheng ACM JEA, 2022
Angle Covers[...]
William Evans, Ellen Gethner, Jack S-J, Alexander Wolff JGAA, 2021
Theses
Graph Morphing via Orthogonal Box Drawings
Jack S-J University of Waterloo, 2023
Workshop Papers and Others
Subquadratic Approximation Algorithms for Separating Two Points[...]
Jayson Lynch, Jack S-J FWCG, 2025
Scalable k-Means Clustering for Large k[...]
Jack S-J, Eliot W. Robson, Da Wei Zheng VecDB@ICML, 2025
Analytic Arc Cover Problem[...]
Eliot W. Robson, Jack S-J, Da Wei Zheng EuroCG, 2025
MOPBucket[...]
Jack S-J, Eliot W. Robson, Da Wei Zheng FWCG, 2024
Computing the Probability of Striking a Battleship
Jack S-J 2024As far as I know, in 2024, this was the best in-memory ANN library not relying on per-vertex quantization, at least the SIFT1M dataset, in terms of recall vs latency
Presentations
Reweighted Spectral Partitioning Works[...]
USC Theory Seminar, 2026
Reweighted Spectral Partitioning Works[...]
OSU Theory Group, 2026
Point Separation Problems in the Plane[...]
UBC Theory Seminar, 2025
Subquadratic Approximations for Separating Two Points[...]
FWCG, 2025
Separating Two Points with Obstacles in the Plane[...]
ESA, 2025
Heuristic Approaches in Computational Geometry[...]
Uni-Bonn A&C Seminar, 2025
Point Separation Problems in the Plane[...]
ITU A&C Seminar, 2025
Scalable k-Means Clustering for Large k[...]
VecDB@ICML, 2025Poster presentation
Contiguous Art Gallery and Related Problems[...]
SoCG, 2025Co-presented with Magnus Christian Ring Merrild
Analytic Arc Cover Problem[...]
EuroCG, 2025
Scalable k-Means Clustering for Large k[...]
USC Theory Seminar, 2025
MOPBucket[...]
FWCG, 2024
Morphing Planar Graph Drawings[...]
GD, 2024
Slant is NP-complete[...]
CCCG, 2024
Graph Morphing via Orthogonal Box Drawings
University of Waterloo, 2023
CBLS for Min Partition into Plane Subgraphs[...]
SoCG, 2022
Computing the Probability of Striking a Battleship
TJCDCGGG, 2021
Angle Covers[...]
WALCOM, 2020
Courses
CPSC 490 - Problem Solving in Computer Science
University of British Columbia January 2020 - April 2020Special course on competitive programming taught by undergraduates. Covered graph algorithms, dynamic programming, range queries, computational geometry, flow, string algorithms.
