I am currently a  postdoc at the University of Copenhagen under a Marie Curie fellowship.

My interests are in Computational Geometry. 

Email: sampson.wong123@gmail.com

Links: scholar, dblp, cv, orcid

• Joachim Gudmundsson, Sampson Wong: A well-separated pair decomposition for low density graphs. SODA 2026. [arXiv]

• Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong: Instance-Optimal Imprecise Convex Hull. ESA 2025. [arXiv]

• Peyman Afshani, Maike Buchin, Anne Driemel, Marena Richter, Sampson Wong: Property Testing of Curve Similarity. ESA 2025. [arXiv]

• Lindsey Deryckere, Joachim Gudmundsson, André van Renssen, Yuan Sha, Sampson Wong: A WSPD, Separator and Small Tree Cover for c-Packed Graphs. WADS 2025. [arXiv]

• Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong: Spanner for the 0/1/∞ Weighted Region Problem. WADS 2025. [arXiv]

• Kevin Buchin, Maike Buchin, Zijin Huang, André Nusser, Sampson Wong: Faster Fréchet Distance Under Transformations. ICALP 2025. [arXiv]

• Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, Sampson Wong: Computing Oriented Spanners and Their Dilation. SoCG 2025. [arXiv] 

• Joachim Gudmundsson, Michael Mai, Sampson Wong: Approximating the Fréchet distance when only one curve is c-packed. ISAAC 2024. [arXiv]

• Ivor van der Hoog, Eva Rotenberg, Sampson Wong: Data Structures for Approximate Discrete Fréchet Distance. ISAAC 2024. [arXiv]

• Kevin Buchin, Maike Buchin, Joachim Gudmundsson and Sampson Wong: Bicriteria approximation for minimum dilation graph augmentation. ESA 2024. [arXiv]

• Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov and Sampson Wong: Map-Matching Queries Under Fréchet Distance on Low-Density Spanners. SoCG 2024. [arXiv]

• Joachim Gudmundsson, Martin P. Seybold, Sampson Wong: Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. SoCG 2024. [arXiv]

• Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel and Sampson Wong: L-Budget Clustering of Curves. SWAT 2024. [LIPIcs] 

• Joachim Gudmundsson, Zijin Huang, Sampson Wong: Approximating the λ-low-density value. COCOON 2023. [arXiv]

• Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong: Computing a Subtrajectory Cluster from c-Packed Trajectories. ISAAC 2023. [arXiv]

• Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong: Oriented Spanners. ESA 2023. [arXiv]

• Andrè van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong: The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. ESA 2023. [arXiv]

• Joachim Gudmundsson, Martin P. Seybold, Sampson Wong: Map matching queries on realistic input graphs under the Fréchet distance. SODA 2023. [arXiv]

• Kevin Buchin, André Nusser, Sampson Wong: Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time. SoCG 2022. [arXiv]

• Joachim Gudmundsson, Sampson Wong: Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. SODA 2022. [arXiv]

• Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong: Covering a set of line segments with a few squares. CIAC 2021, TCS 2022. [arXiv]

• Joachim Gudmundsson, Sampson Wong: Improving the dilation of metric graphs by adding edges. SODA 2021, TALG 2022. [arXiv]

• Joachim Gudmundsson, Yuan Sha, Sampson Wong: Approximating the packedness of polygonal curves. ISAAC 2020, CGTA 2023. [arXiv]

• Milutin Brankovic, Kevin Buchin, Koen Klaren, André Nusser, Aleksandr Popov, Sampson Wong: (k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping. SIGPSPATIAL 2020. [arXiv]

• Joachim Gudmundsson, André van Renssen, Zeinab Saedi, Sampson Wong: Translation Invariant Fréchet Distance Queries. ICCG 2020, Algorithmica 2021. [arXiv]

• Joachim Gudmundsson, Sampson Wong: Computing the Yolk in Spatial Voting Games without Computing Median Lines: AAAI 2019. [arXiv]

• Stephan Tillmann, Sampson Wong: An algorithm for the Euclidean cell decomposition of a cusped strictly convex projective surface.  JoCG 2016. [arXiv]

• Analysing trajectory similarity and improving graph dilation. PhD thesis, University of Sydney, 2023. [link]

• Applying parametric search to voting games and Fréchet queries. Master's thesis, University of Sydney, 2019. [link]

• Algorithms for the Epstein-Penner decomposition of a cusped surface. Bachelor's thesis, University of Sydney, 2014. [link]

• Marie Curie Postdoctoral Fellowship, 2025-2027. [TBA]

• Google PhD Fellowship, 2021. [link]

• Australian Deputy Leader for International Mathematical Olympiad, 2019 - 2022. [link]