OpenAlex ·
Volume stability of plank covers
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.30409
- Original
- Read it at the publisher
- Topics
Abstract
We prove a longstanding conjecture of András Bezdek on the stability of plank covers of the planar disk $D$. If a sufficiently small disk $\varepsilon D$ is removed, then every finite family of planks covering the resulting annulus can be rearranged to cover the whole disk. For the proof, we establish a stronger dimension-independent stability theorem. If $K \subset {\mathbb R}^n$ is an origin-symmetric convex body for $n \geq 2$, and the uncovered region lies in $\varepsilon K$ and has volume $v$, then the excess overlap is at least $c v/\varepsilon$, where $c>0$ is an absolute constant. The proof introduces a pruning procedure and a flattening mechanism. Pruning peels away curvature through local removals whose cumulative effect is guaranteed to be substantial. Flattening trades straightness for bounded multiplicity and geometrically exposes the overlap that pays for each pruning step.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Graphics
OREO: Fidelity Alignment in 3D Generation via On-the-fly Rendering-Editing Optimization
DiffusionShadow: Diffusion-based Shadow Caching for Neural Volume Rendering
Seeing Speech: Learning Visible Articulatory Dynamics for Speech-Driven 3D Facial Animation
ChronoFuseGS: Multi-Temporal Gaussian Fusion with Per-Splat Persistence and Change Visualization
Depth Any Seen: Which Surfaces and How Far?
Get the few papers worth your time in Graphics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.