Copertina

Online Sorting and Translational Packing of Convex Polygons

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Aamand, Anders, Abrahamsen, Mikkel, Beretta, Lorenzo, Kleist, Linda
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Computational Geometry Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Online sorting and online TSP: randomized, stochastic, and high-dimensional
di: Abrahamsen, Mikkel, et al.
Pubblicazione: (2024)

Touring a Sequence of Orthogonal Polygons
di: Casel, Katrin, et al.
Pubblicazione: (2026)

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

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
di: Abrahamsen, Mikkel
Pubblicazione: (2024)

Simple Grid Polygon Online Exploration Revisited
di: Brock, Maximilian, et al.
Pubblicazione: (2024)

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

Visibility Queries in Simple Polygons
di: Bhore, Sujoy, et al.
Pubblicazione: (2026)

Efficient Enumeration of At Most $k$-Out Polygons
di: Akram, Waseem, et al.
Pubblicazione: (2025)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
di: Eppstein, David
Pubblicazione: (2025)

Data Structures for Range Sorted Consecutive Occurrence Queries
di: Akram, Waseem, et al.
Pubblicazione: (2024)

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

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
di: de Berg, Sarita, et al.
Pubblicazione: (2023)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
di: Kar, Debajyoti, et al.
Pubblicazione: (2025)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
di: An, Shinwoo, et al.
Pubblicazione: (2024)

Dynamic Convex Hulls for Simple Paths
di: Brewer, Bruce, et al.
Pubblicazione: (2024)

Engineering Fully Dynamic Convex Hulls
di: van der Hoog, Ivor, et al.
Pubblicazione: (2026)

Shortest Paths on Convex Polyhedral Surfaces
di: Wang, Haitao
Pubblicazione: (2025)

Maximum Independent Sets in Disk Graphs with Disks in Convex Position
di: Tkachenko, Anastasiia, et al.
Pubblicazione: (2026)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
di: Tkachenko, Anastasiia, et al.
Pubblicazione: (2026)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
di: van der Hoog, Ivor, et al.
Pubblicazione: (2025)

Hashing for Sampling-Based Estimation
di: Aamand, Anders, et al.
Pubblicazione: (2024)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
di: Dorfer, Joseph
Pubblicazione: (2026)

Near-Optimal Trace Reconstruction for Mildly Separated Strings
di: Aamand, Anders, et al.
Pubblicazione: (2024)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
di: Afshani, Peyman, et al.
Pubblicazione: (2026)

Improved Hardness of Approximation for Geometric Bin Packing
di: Ray, Arka, et al.
Pubblicazione: (2023)

Online Algorithms for Geometric Independent Set
di: De, Minati, et al.
Pubblicazione: (2026)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
di: Galby, Esther, et al.
Pubblicazione: (2023)

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

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
di: Bhore, Sujoy, et al.
Pubblicazione: (2023)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
di: Deligkas, Argyrios, et al.
Pubblicazione: (2026)

Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev's Sorting Networks as Base Cases
di: Aly, Anas Gamal, et al.
Pubblicazione: (2025)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
di: Bekos, Michael A., et al.
Pubblicazione: (2025)

Private Approximations of a Convex Hull in Low Dimensions
di: Gao, Yue, et al.
Pubblicazione: (2020)

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

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
di: Goodrich, Michael T., et al.
Pubblicazione: (2024)

Improved Online Sorting
di: Nirjhor, Jubayer, et al.
Pubblicazione: (2025)

Online Facility Assignments on Polygons
di: Malik, Sumaiya, et al.
Pubblicazione: (2025)

Skirting Additive Error Barriers for Private Turnstile Streams
di: Aamand, Anders, et al.
Pubblicazione: (2026)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
di: Fekete, Sándor P., et al.
Pubblicazione: (2024)

New Statistical and Computational Results for Learning Junta Distributions
di: Beretta, Lorenzo
Pubblicazione: (2025)