2024
Efficiently reconfiguring a connected swarm of labeled robots.
Auton. Agents Multi Agent Syst., December, 2024
The dispersive art gallery problem.
Comput. Geom., February, 2024
Dispersive Vertex Guarding for Simple and Non-Simple Polygons.
CoRR, 2024
Lessons Learned from Integrating a Metaverse App into a CS Math Course to Increase Commuter Student Participation.
Proceedings of the 2024 ACM Virtual Global Computing Education Conference V. 1, 2024
Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
2023
Connected coordinated motion planning with bounded stretch.
Auton. Agents Multi Agent Syst., October, 2023
Packing Disks into Disks with Optimal Worst-Case Density.
Discret. Comput. Geom., 2023
The Lawn Mowing Problem: From Algebra to Algorithms.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023
2022
The prefix Fréchet similarity.
Comput. Geom., 2022
Particle-Based Assembly Using Precise Global Control.
Algorithmica, 2022
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots.
Algorithmica, 2022
Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition).
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Worst-Case Optimal Squares Packing into Disks.
J. Comput. Geom., 2021
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata.
Algorithmica, 2021
Packing Squares into a Disk with Optimal Worst-Case Density.
Proceedings of the 37th International Symposium on Computational Geometry, 2021
2020
Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces.
Algorithmica, 2020
Train Scheduling: Hardness and Algorithms.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020
Recognition and Reconfiguration of Lattice-Based Cellular Structures by Simple Robots.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020
Covering Rectangles by Disks: The Video (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020
Worst-Case Optimal Covering of Rectangles by Disks.
Proceedings of the 36th International Symposium on Computational Geometry, 2020
Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition).
,
,
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the 36th International Symposium on Computational Geometry, 2020
Scheduling Three Trains is NP-Complete.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.
SIAM J. Comput., 2019
Approximate shortest distances among smooth obstacles in 3D.
J. Comput. Geom., 2019
Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density.
Discret. Comput. Geom., 2019
Connected Assembly and Reconfiguration by Finite Automata.
CoRR, 2019
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition).
Proceedings of the 35th International Symposium on Computational Geometry, 2019
2018
Conflict-Free Coloring of Graphs.
SIAM J. Discret. Math., 2018
Universal Guard Problems.
Int. J. Comput. Geom. Appl., 2018
Approximating the integral Fréchet distance.
Comput. Geom., 2018
Path Refinement in Weighted Regions.
Algorithmica, 2018
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
Coordinated Motion Planning: The Video (Multimedia Exposition).
Proceedings of the 34th International Symposium on Computational Geometry, 2018
2017
New geometric algorithms for fully connected staged self-assembly.
Theor. Comput. Sci., 2017
An efficient data structure for dynamic two-dimensional reconfiguration.
J. Syst. Archit., 2017
Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Resource-efficient dynamic partial reconfiguration on FPGAs for space instruments.
Proceedings of the 2017 NASA/ESA Conference on Adaptive Hardware and Systems, 2017
2016
Near-linear time medial axis approximation of smooth curves in $\mathbb{R}^3$.
J. Comput. Geom., 2016
More Flexible Curve Matching via the Partial Fréchet Similarity.
Int. J. Comput. Geom. Appl., 2016
2015
Subquadratic medial-axis approximation in $\mathbb{R}^3$.
J. Comput. Geom., 2015
2014
Approximating geodesic distances on 2-manifolds in R<sup>3</sup>: The weighted case.
Comput. Geom., 2014
Approximating geodesic distances on 2-manifolds in R<sup>3</sup>.
Comput. Geom., 2014
Similarity of polygonal curves in the presence of outliers.
Comput. Geom., 2014
Minimum backward fréchet distance.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014
Approximation algorithms for geometrical distance problems that are not solvable exactly.
PhD thesis, 2014
2011
Approximating Geodesic Distances on 2-Manifolds in R3.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011