Cover Image

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abrahamsen, Mikkel, Bhore, Sujoy, Buchin, Maike, Conradi, Jacobus, Jin, Ce, Nusser, André, Rehs, Carolin
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing Non-Obtuse Triangulations with Few Steiner Points
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Minimum Star Partitions of Simple Polygons in Polynomial Time
by: Abrahamsen, Mikkel, et al.
Published: (2023)

Geometric spanners of bounded tree-width
by: Buchin, Kevin, et al.
Published: (2024)

Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
by: Blank, Lotte, et al.
Published: (2025)

On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)

Faster Fréchet Distance under Transformations
by: Buchin, Kevin, et al.
Published: (2025)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
by: Chan, Timothy M., et al.
Published: (2025)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Bounding a Polygon by a Minimum Number of Vertices
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Partitioning a Polygon Into Small Pieces
by: Abrahamsen, Mikkel, et al.
Published: (2022)

Online Sorting and Translational Packing of Convex Polygons
by: Aamand, Anders, et al.
Published: (2021)

Oriented Spanners
by: Buchin, Kevin, et al.
Published: (2023)

Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)

Clustering with Few Disks to Minimize the Sum of Radii
by: Abrahamsen, Mikkel, et al.
Published: (2023)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
by: Bhore, Sujoy, et al.
Published: (2024)

Bicriteria approximation for minimum dilation graph augmentation
by: Buchin, Kevin, et al.
Published: (2024)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
by: Bhore, Sujoy, et al.
Published: (2026)

Fully Dynamic Geometric Vertex Cover and Matching
by: Bhore, Sujoy, et al.
Published: (2024)

Light Spanners with Small Hop-Diameter
by: Bhore, Sujoy, et al.
Published: (2025)

Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
by: Buchin, Kevin, et al.
Published: (2025)

A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
by: Buchin, Kevin, et al.
Published: (2026)

Ten Problems in Geobotics
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
by: Chung, Jaehoon
Published: (2026)

Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)

Geometric Bipartite Matching is in NC
by: Bhore, Sujoy, et al.
Published: (2024)

$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
by: Conradi, Jacobus, et al.
Published: (2023)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
by: Conradi, Jacobus, et al.
Published: (2025)

Dynamic and Streaming Algorithms for Union Volume Estimation
by: Bhore, Sujoy, et al.
Published: (2026)

Online Epsilon Net and Piercing Set for Geometric Concepts
by: Bhore, Sujoy, et al.
Published: (2024)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
by: Abrahamsen, Mikkel, et al.
Published: (2020)

Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
by: Angrick, Sebastian, et al.
Published: (2026)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
by: Bhore, Sujoy, et al.
Published: (2025)

Dynamic Light Spanners in Doubling Metrics
by: Bhore, Sujoy, et al.
Published: (2026)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
by: Bringmann, Karl, et al.
Published: (2024)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
by: Bhore, Sujoy, et al.
Published: (2025)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)

Fast Approximations and Coresets for (k, l)-Median under Dynamic Time Warping
by: Conradi, Jacobus, et al.
Published: (2023)

Computing Planar Convex Hulls with a Promise
by: Aghamolaei, Sepideh, et al.
Published: (2026)