Packing 2D disks into a 3D container

10/25/2021
by   Helmut Alt, et al.
0

In this article, we consider the problem of finding in three dimensions a minimum-volume axis-parallel box into which a given set of unit-radius disks can be packed under translations. The problem is neither known to be NP-hard nor to be in NP. We give a constant-factor approximation algorithm based on reduction to finding a shortest Hamiltonian path in a weighted graph. As a byproduct, we can show that there is no finite size container into which all unit disks can be packed simultaneously.

READ FULL TEXT
research
03/29/2022

Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs

Unit disk graphs are the set of graphs which represent the intersection ...
research
07/23/2020

Total Domination in Unit Disk Graphs

Let G=(V,E) be an undirected graph. We call D_t ⊆ V as a total dominatin...
research
07/05/2017

Placing your Coins on a Shelf

We consider the problem of packing a family of disks "on a shelf", that ...
research
02/16/2022

Flat tori with large Laplacian eigenvalues in dimensions up to eight

We consider the optimization problem of maximizing the k-th Laplacian ei...
research
09/14/2023

Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering

Given a set of points labeled with k labels, we introduce the heat map s...
research
02/04/2014

Optimal Rectangle Packing: An Absolute Placement Approach

We consider the problem of finding all enclosing rectangles of minimum a...
research
09/01/2023

A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem

Sublinear time complexity is required by the massively parallel computat...

Please sign up or login with your details

Forgot password? Click here to reset