arXiv · 2502.03115
Comparison of 2D Regular Lattices for the CPWL Approximation of Functions
Abstract
We investigate the approximation error of functions with continuous and piecewise-linear (CPWL) representations. We focus on the CPWL search spaces generated by translates of box splines on two-dimensional regular lattices. We compute the approximation error in terms of the stepsize and angles that define the lattice. Our results show that hexagonal lattices are optimal, in the sense that they minimize the asymptotic approximation error.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mehrsa Pourya, Maïka Nogarotto, Michael Unser. 2025-02-05. Comparison of 2D Regular Lattices for the CPWL Approximation of Functions. https://arxiv.org/abs/2502.03115
Cite the original work for its findings. Save a collection to share your selection of sources.