Copertina

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chan, Timothy M., Hair, Isaac M.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computational Geometry
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Convex Polygon Containment: Improving Quadratic to Near Linear Time
di: Chan, Timothy M., et al.
Pubblicazione: (2024)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
di: Abrahamsen, Mikkel, et al.
Pubblicazione: (2025)

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
di: Chan, Timothy M.
Pubblicazione: (2026)

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

Ipelets for the Convex Polygonal Geometry
di: Parepally, Nithin, et al.
Pubblicazione: (2024)

Convex Covering Using Collections of Convex Polygons and Set Cover
di: da Fonseca, Guilherme D.
Pubblicazione: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
di: Grandoni, Fabrizio, et al.
Pubblicazione: (2024)

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
di: de Berg, Mark, et al.
Pubblicazione: (2026)

Convex Sequence and Convex Polygon
di: Goswami, Angshuman Robin, et al.
Pubblicazione: (2024)

Dynamic Geometric Connectivity in the Plane with Constant Query Time
di: Chan, Timothy M., et al.
Pubblicazione: (2024)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
di: Aichholzer, Oswin, et al.
Pubblicazione: (2025)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
di: Chung, Chaeyoon, et al.
Pubblicazione: (2026)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
di: Rajabi-Alni, Fatemeh, et al.
Pubblicazione: (2024)

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

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
di: Damian, Mirela, et al.
Pubblicazione: (2003)

An Overview of Minimum Convex Cover and Maximum Hidden Set
di: Browne, Reilly
Pubblicazione: (2024)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
di: Dhar, Anubhav, et al.
Pubblicazione: (2024)

Software for the Thompson and Funk Polygonal Geometry
di: Banerjee, Hridhaan, et al.
Pubblicazione: (2025)

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

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
di: Yang, Chao, et al.
Pubblicazione: (2025)

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

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

Tiling with Three Polygons is Undecidable
di: Demaine, Erik D., et al.
Pubblicazione: (2024)

A Polynomial-Time Algorithm for Computing the Exact Convex Hull in High-Dimensional Spaces
di: Zhuang, Qianwei
Pubblicazione: (2025)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
di: Fekete, Sándor P., et al.
Pubblicazione: (2024)

Direct Sampling of Confined Polygons in Linear Time
di: Shonkwiler, Clayton, et al.
Pubblicazione: (2025)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
di: Chan, Timothy M., et al.
Pubblicazione: (2025)

Approximate Algorithms for Chamfer Distance Under Translation
di: Halevi, Gil, et al.
Pubblicazione: (2026)

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
di: Barequet, Gill, et al.
Pubblicazione: (2025)

Escaping a Polygon
di: Abel, Zachary, et al.
Pubblicazione: (2020)

Undecidability of Translational Tiling with Three Tiles
di: Yang, Chan, et al.
Pubblicazione: (2024)

Robustly Guarding Polygons
di: Das, Rathish, et al.
Pubblicazione: (2024)

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

Computing the Girth of a Segment Intersection Graph
di: Chan, Timothy M., et al.
Pubblicazione: (2026)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
di: Har-Peled, Sariel, et al.
Pubblicazione: (2014)

French Onion Soup, Ipelets for Points and Polygons
di: Faber, Klint, et al.
Pubblicazione: (2025)

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

An Output Sensitive Algorithm for Discrete Convex Hulls
di: Har-Peled, Sariel
Pubblicazione: (2026)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
di: Boomari, Hossein, et al.
Pubblicazione: (2018)

Compatible Triangulations of Simple Polygons
di: Afshani, Peyman, et al.
Pubblicazione: (2026)