Jack Spalding-Jamieson

According to our database, Jack Spalding-Jamieson authored at least 17 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane.

Jayson Lynch, Jack Spalding-Jamieson

CoRR, July, 2025

Reweighted Spectral Partitioning Works: Bounds for Special Graph Classes.

Jack Spalding-Jamieson

CoRR, June, 2025

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds.

Jack Spalding-Jamieson, Anurag Murty Naredla

CoRR, April, 2025

Slant/Gokigen Naname is NP-complete, and Some Variations are in P.

Jayson Lynch, Jack Spalding-Jamieson

CoRR, February, 2025

Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search.

Jack Spalding-Jamieson, Eliot Wong Robson, Da Wei Zheng

CoRR, February, 2025

Polynomial-Time Algorithms for 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 C. Shermer, Jack Spalding-Jamieson, Rolf Svenning, Da Wei Zheng

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving.

Eliot W. Robson, Jack Spalding-Jamieson, Da Wei Zheng

CoRR, 2024

Morphing Planar Graph Drawings via Orthogonal Box Drawings.

Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Carving Polytopes with Saws in 3D.

Eliot W. Robson, Jack Spalding-Jamieson, Da Wei Zheng

Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

Slant/Gokigen Naname is NP-complete.

Jayson Lynch, Jack Spalding-Jamieson

Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.

Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng

ACM J. Exp. Algorithmics, December, 2023

2022

Coordinated Motion Planning Through Randomized <i>k</i>-Opt.

Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng

ACM J. Exp. Algorithmics, 2022

Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge).

Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Angle Covers: Algorithms and Complexity.

William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff

J. Graph Algorithms Appl., 2021

Coordinated Motion Planning Through Randomized k-Opt.

Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng

CoRR, 2021

Coordinated Motion Planning Through Randomized k-Opt (CG Challenge).

Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge).

Da Wei Zheng, Jack Spalding-Jamieson, Brandon Zhang

Proceedings of the 36th International Symposium on Computational Geometry, 2020