Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Packing $d$-dimensional balls into a $d + 1$-dimensional container
Authors:ID Alt, Helmut (Author)
ID Cabello, Sergio (Author)
ID Cheong, Otfried (Author)
ID Park, Ji-won (Author)
ID Seiferth, Nadja (Author)
Files:.pdf PDF - Presentation file, download (1,01 MB)
MD5: 0B37C1C4CBA562D3CE602CE909955EC7
 
URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0925772125000574
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:In this article, we consider the problems of finding in $d + 1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius balls can be packed under translations. The computational problem is neither known to be NP-hard nor to be in NP. We give a constant-factor approximation algorithm for each of these containers based on a reduction to finding a shortest Hamiltonian path in a weighted graph, which in turn models the problem of stabbing the centers of the input balls while keeping them disjoint. We also show that for $n$ such balls, a container of volume $O(n^{d−1 \over d})$ is always sufficient and sometimes necessary. As a byproduct, this implies that for $d \ge 2$ there is no finite size $(d + 1)$-dimensional convex body into which all $d$-dimensional unit-radius balls can be packed simultaneously.
Keywords:packings, translations, unit disks, unit balls, volume
Publication status:Published
Publication version:Version of Record
Publication date:01.05.2026
Year of publishing:2026
Number of pages:13 str.
Numbering:Vol. 132, article no. 102219
PID:20.500.12556/DiRROS-24501 New window
UDC:004.92:514
ISSN on article:0925-7721
DOI:10.1016/j.comgeo.2025.102219 New window
COBISS.SI-ID:259634179 New window
Note:
Publication date in DiRROS:02.12.2025
Views:94
Downloads:50
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Computational geometry
Shortened title:Comput. geom.
Publisher:Elsevier
ISSN:0925-7721
COBISS.SI-ID:14903301 New window

Document is financed by a project

Funder:DAAD - German Academic Exchange Service
Funding programme:FITweltweit program

Funder:DAAD - German Academic Exchange Service
Funding programme:Johann-GottfriedHerder program

Funder:German Science Foundation
Funding programme:Collaborative DACH project Arrangements and Drawings
Project number:MU3501/3-1

Funder:Other - Other funder or multiple funders
Funding programme:Starlab project
Project number:IITP-2015-0-00199

Funder:Other - Other funder or multiple funders
Funding programme:Starlab project
Project number:NRF-2017M3C4A7066317

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-2452
Name:Strukturni, optimizacijski in algoritmični problemi v geometrijskih in topoloških predstavitvah grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0218
Name:Prepletanje geometrije, topologije in algebre v strukturni in topološki teoriji grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:EC - European Commission
Project number:101071836
Name:KARST: Predicting flow and transport in complex Karst systems
Acronym:KARST

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Back