Image de couverture de livre

How Packed Is It, Really?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Har-Peled, Sariel, Zhou, Timothy
Format:	Preprint
Publié:	2021
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Separator for $c$-Packed Segments and Curves
par: Har-Peled, Sariel
Publié: (2026)

How to Get Close to the Median Shape
par: Har-Peled, Sariel
Publié: (2026)

Bifurcation: How to Explore a Tree
par: Har-Peled, Sariel
Publié: (2025)

A Practical Approach for Computing the Diameter of a Point Set
par: Har-Peled, Sariel
Publié: (2025)

The Complexity of One or Many Faces in the Overlay of Many Arrangements
par: Har-Peled, Sariel
Publié: (2025)

An Output Sensitive Algorithm for Discrete Convex Hulls
par: Har-Peled, Sariel
Publié: (2026)

A Simple Proof of the Existence of a Planar Separator
par: Har-Peled, Sariel
Publié: (2011)

The Prophet and the Voronoi Diagram
par: Har-Peled, Sariel
Publié: (2026)

Approximately: Independence Implies Vertex Cover
par: Har-Peled, Sariel
Publié: (2023)

Approximating Densest Subgraph in Geometric Intersection Graphs
par: Har-Peled, Sariel, et autres
Publié: (2024)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
par: Barequet, Gill, et autres
Publié: (2025)

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
par: Barequet, Gill, et autres
Publié: (2025)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
par: Har-Peled, Sariel, et autres
Publié: (2014)

Near-Optimal Euclidean Locality-Sensitive Orderings
par: Gao, Zhimeng, et autres
Publié: (2023)

In the Search for Good Neck Cuts
par: Ruggerio, Sam, et autres
Publié: (2026)

Proof of Dudley's Convex Approximation
par: Har-Peled, Sariel, et autres
Publié: (2019)

Improving the average dilation of a metric graph by adding edges
par: Har-Peled, Sariel, et autres
Publié: (2025)

No-dimensional Tverberg Partitions Revisited
par: Har-Peled, Sariel, et autres
Publié: (2023)

New Constructions of SSPDs and their Applications
par: Abam, Mohammad A., et autres
Publié: (2025)

Orthogonal Emptiness Queries for Random Points
par: Dullerud, Jonathan E., et autres
Publié: (2025)

Dependable Spanners via Unreliable Edges
par: Har-Peled, Sariel, et autres
Publié: (2024)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
par: Har-Peled, Sariel, et autres
Publié: (2024)

Well-Separated Pairs Decomposition Revisited
par: Har-Peled, Sariel, et autres
Publié: (2025)

The Road to the Closest Point is Paved by Good Neighbors
par: Har-Peled, Sariel, et autres
Publié: (2025)

Fast Approximation Algorithms for Piercing Boxes by Points
par: Agarwal, Pankaj K., et autres
Publié: (2023)

Graph-Based Nearest-Neighbor Search without the Spread
par: Giliberti, Jeff, et autres
Publié: (2026)

An Easy Proof of a Weak Version of Chernoff inequality
par: Har-Peled, Sariel
Publié: (2025)

On Small Pair Decompositions for Point Sets
par: Buchin, Kevin, et autres
Publié: (2026)

Oracle-Augmented Prophet Inequalities
par: Har-Peled, Sariel, et autres
Publié: (2024)

Quickly Avoiding a Random Catastrophe
par: Ashur, Stav, et autres
Publié: (2025)

Faster Motion Planning via Restarts
par: Amato, Nancy, et autres
Publié: (2025)

Edge Nearest Neighbor in Sampling-Based Motion Planning
par: Ashur, Stav, et autres
Publié: (2025)

Solution-Hashing Search Based on Layout-Graph Transformation for Unequal Circle Packing
par: Zhou, Jianrong, et autres
Publié: (2024)

Online Packing of Orthogonal Polygons
par: Gerlach, Tim, et autres
Publié: (2026)

Shadoks Approach to Knapsack Polygonal Packing
par: da Fonseca, Guilherme D., et autres
Publié: (2024)

Packing d-dimensional balls into a d+1-dimensional container
par: Alt, Helmut, et autres
Publié: (2021)

Hardness and Approximation Schemes for Discrete Packing and Domination
par: Madireddy, Raghunath Reddy, et autres
Publié: (2025)

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
par: Acharya, Pritam, et autres
Publié: (2024)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
par: Zhou, Yi, et autres
Publié: (2026)