Reconfiguration of Squares Using a Constant Number of Moves Each
Fuente:
arXiv
Saved in:
| Main Authors: | van der Horst, Thijs, Löffler, Maarten, Ophelders, Tim, Peters, Tom |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Faster, Deterministic and Space Efficient Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2024)
by: van der Hoog, Ivor, et al.
Published: (2024)
Computing the Fréchet Distance When Just One Curve is $c$-Packed: A Simple Almost-Tight Algorithm
by: Conradi, Jacobus, et al.
Published: (2025)
by: Conradi, Jacobus, et al.
Published: (2025)
The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)
by: van der Horst, Thijs, et al.
Published: (2025)
A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
by: van der Horst, Thijs, et al.
Published: (2025)
by: van der Horst, Thijs, et al.
Published: (2025)
Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)
by: van der Horst, Thijs, et al.
Published: (2024)
Locally Correct Interleavings between Merge Trees
by: Beurskens, Thijs, et al.
Published: (2025)
by: Beurskens, Thijs, et al.
Published: (2025)
Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022)
by: Buchin, Kevin, et al.
Published: (2022)
Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)
by: Beurskens, Thijs, et al.
Published: (2023)
Sweeping Orders for Simplicial Complex Reconstruction
by: Ophelders, Tim, et al.
Published: (2025)
by: Ophelders, Tim, et al.
Published: (2025)
Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)
by: Glazenburg, Erwin, et al.
Published: (2024)
Preprocessing Disks for Convex Hulls, Revisited
by: Löffler, Maarten, et al.
Published: (2025)
by: Löffler, Maarten, et al.
Published: (2025)
Fréchet Distance in Unweighted Planar Graphs
by: van der Hoog, Ivor, et al.
Published: (2025)
by: van der Hoog, Ivor, et al.
Published: (2025)
ParkView: Visualizing Monotone Interleavings
by: Beurskens, Thijs, et al.
Published: (2025)
by: Beurskens, Thijs, et al.
Published: (2025)
Which Vertical Graphs are Non VPHT Reconstructible?
by: Gutzeit, Jette, et al.
Published: (2026)
by: Gutzeit, Jette, et al.
Published: (2026)
Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
by: Abrahamsen, Mikkel, et al.
Published: (2024)
by: Abrahamsen, Mikkel, et al.
Published: (2024)
Counting Triangulations of Fixed Cardinal Degrees
by: Chambers, Erin, et al.
Published: (2025)
by: Chambers, Erin, et al.
Published: (2025)
Fast Reconfiguration for Programmable Matter
by: Kostitsyna, Irina, et al.
Published: (2022)
by: Kostitsyna, Irina, et al.
Published: (2022)
A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves
by: Abel, Zachary, et al.
Published: (2008)
by: Abel, Zachary, et al.
Published: (2008)
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
by: Löffler, Maarten, et al.
Published: (2024)
by: Löffler, Maarten, et al.
Published: (2024)
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
by: van der Hoog, Ivor, et al.
Published: (2024)
by: van der Hoog, Ivor, et al.
Published: (2024)
The Complexity of Geodesic Spanners using Steiner Points
by: de Berg, Sarita, et al.
Published: (2024)
by: de Berg, Sarita, et al.
Published: (2024)
Garment numbers of bi-colored point sets in the plane
by: Aichholzer, Oswin, et al.
Published: (2026)
by: Aichholzer, Oswin, et al.
Published: (2026)
Adjacency Graphs of Polyhedral Surfaces
by: Arseneva, Elena, et al.
Published: (2021)
by: Arseneva, Elena, et al.
Published: (2021)
Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
by: Garcia, Javier, et al.
Published: (2025)
by: Garcia, Javier, et al.
Published: (2025)
Theoretical analysis of beaconless geocast protocols in 1D
by: Gudmundsson, Joachim, et al.
Published: (2025)
by: Gudmundsson, Joachim, et al.
Published: (2025)
Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
On Solving Simple Curved Nonograms
by: Löffler, Maarten, et al.
Published: (2025)
by: Löffler, Maarten, et al.
Published: (2025)
Drawing Reeb Graphs
by: Chambers, Erin, et al.
Published: (2025)
by: Chambers, Erin, et al.
Published: (2025)
Terrain prickliness: theoretical grounds for high complexity viewsheds
by: Acharyya, Ankush, et al.
Published: (2021)
by: Acharyya, Ankush, et al.
Published: (2021)
Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
by: Bui, Hong Duc
Published: (2025)
by: Bui, Hong Duc
Published: (2025)
Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring
by: Garcia, Javier, et al.
Published: (2022)
by: Garcia, Javier, et al.
Published: (2022)
Crossing Number is NP-hard for Constant Path-width (and Tree-width)
by: Hliněný, Petr, et al.
Published: (2024)
by: Hliněný, Petr, et al.
Published: (2024)
Gromov-Wasserstein at Scale, Beyond Squared Norms
by: Houry, Guillaume, et al.
Published: (2026)
by: Houry, Guillaume, et al.
Published: (2026)
Online Hitting Set for Axis-Aligned Squares
by: De, Minati, et al.
Published: (2025)
by: De, Minati, et al.
Published: (2025)
Optimal Motion Planning for Two Square Robots in a Rectilinear Environment
by: Agarwal, Pankaj K., et al.
Published: (2026)
by: Agarwal, Pankaj K., et al.
Published: (2026)
Shadoks Approach to Parallel Reconfiguration of Triangulations
by: da Fonseca, Guilherme D., et al.
Published: (2026)
by: da Fonseca, Guilherme D., et al.
Published: (2026)
Input-Sensitive Reconfiguration of Sliding Cubes
by: Akitaya, Hugo, et al.
Published: (2025)
by: Akitaya, Hugo, et al.
Published: (2025)
On the Discrete Fréchet Distance in a Graph
by: Driemel, Anne, et al.
Published: (2022)
by: Driemel, Anne, et al.
Published: (2022)
Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
by: van der Laan, Joost, et al.
Published: (2026)
by: van der Laan, Joost, et al.
Published: (2026)
Tiling Rectangles and the Plane using Squares of Integral Sides
by: Bigham, Bahram Sadeghi, et al.
Published: (2021)
by: Bigham, Bahram Sadeghi, et al.
Published: (2021)
Similar Items
-
Faster, Deterministic and Space Efficient Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2024) -
Computing the Fréchet Distance When Just One Curve is $c$-Packed: A Simple Almost-Tight Algorithm
by: Conradi, Jacobus, et al.
Published: (2025) -
The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025) -
A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
by: van der Horst, Thijs, et al.
Published: (2025) -
Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)