3 papers
cs.DM2025
Slant/Gokigen Naname is NP-complete, and Some Variations are in P
Jayson Lynch, Jack Spalding-Jamieson
In this paper we show that a generalized version of the Nikoli puzzle Slant is NP-complete. We also give polynomial time algorithms for versions of the puzzle where some constraint…
cs.LG2025
Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
Jack Spalding-Jamieson, Eliot Wong Robson, Da Wei Zheng
For very large values of , we consider methods for fast -means clustering of massive datasets with points in high-dimensions (). All current practica…
cs.CG2021
Coordinated Motion Planning Through Randomized k-Opt
Paul Liu, Jack Spalding-Jamieson, Brandon Zhang +1
This paper examines the approach taken by team gitastrophe in the CG:SHOP 2021 challenge. The challenge was to find a sequence of simultaneous moves of square robots between two gi…