Mapping squares to cubes with optimal smoothness exponent
On surfaces, that fill the space
Computational Geometry
Summary
The paper deals with mapping a square shape into a cube in a way that stretches it smoothly but as much as possible, measured by something called the Holder exponent. The authors find a mapping from a 2D square to a 3D cube with a Holder exponent of two-thirds, which is the best possible smoothness level. This solves a known mathematical problem posed by V.I. Arnold. Their work helps understand how to fill higher-dimensional spaces with lower-dimensional shapes smoothly.
What this means in practice
- •For computer graphics developers: Design transformations that map 2D textures or surfaces onto 3D objects with controlled smoothness properties.
- •For data visualization engineers: Create mappings that lift 2D data displays into 3D visual space while maintaining maximum smoothness for better interpretation.
A theory result. No direct application yet.
Authors
E. V. Shchepin
Abstract
The article is devoted to the construction of dimension-raising maps of cubes with the highest possible Holder exponent. In particular, a square-to-cube mapping with a Holder exponent of $2/3$ is constructed, which is a solution to the V.I.Arnold problem.