Refinability of splines from lattice Voronoi cells

09/26/2012
by   Jorg Peters, et al.
0

Splines can be constructed by convolving the indicator function of the Voronoi cell of a lattice. This paper presents simple criteria that imply that only a small subset of such spline families can be refined: essentially the well-known box splines and tensor-product splines. Among the many non-refinable constructions are hex-splines and their generalization to non-Cartesian lattices. An example shows how non-refinable splines can exhibit increased approximation error upon refinement of the lattice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2019

Construction of s-extremal optimal unimodular lattices in dimension 52

An s-extremal optimal unimodular lattice in dimension 52 is constructed ...
research
04/10/2023

A Practical Box Spline Compendium

Box splines provide smooth spline spaces as shifts of a single generatin...
research
04/04/2023

Comparison of Two Search Criteria for Lattice-based Kernel Approximation

The kernel interpolant in a reproducing kernel Hilbert space is optimal ...
research
11/05/2021

Lattice Packings of Cross-polytopes Constructed from Sidon Sets

A family of lattice packings of n-dimensional cross-polytopes (ℓ_1 balls...
research
05/14/2020

Construction C^ from Self-Dual Codes

Construction C^ was recently introduced as a generalization of the multi...
research
12/23/2015

A Latent-Variable Lattice Model

Markov random field (MRF) learning is intractable, and its approximation...
research
12/20/2014

Permutohedral Lattice CNNs

This paper presents a convolutional layer that is able to process sparse...

Please sign up or login with your details

Forgot password? Click here to reset