Quasi-uniform designs with optimal and near-optimal uniformity constant

12/20/2021
by   Luc Pronzato, et al.
4

A design is a collection of distinct points in a given set X, which is assumed to be a compact subset of R^d, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a sequence of nested designs is the smallest upper bound for the mesh-ratios of the designs. We derive a lower bound on this uniformity constant and show that a simple greedy construction achieves this lower bound. We then extend this scheme to allow more flexibility in the design construction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2017

The Constant of Proportionality in Lower Bound Constructions of Point-Line Incidences

Let I(n,l) denote the maximum possible number of incidences between n po...
research
07/22/2020

Approximate Covering with Lower and Upper Bounds via LP Rounding

In this paper, we study the lower- and upper-bounded covering (LUC) prob...
research
02/06/2018

Near-Optimal Coresets of Kernel Density Estimates

We construct near-optimal coresets for kernel density estimate for point...
research
02/10/2021

A better lower bound for Lower-Left Anchored Rectangle Packing

Given any set of points S in the unit square that contains the origin, d...
research
08/18/2019

The smallest grammar problem revisited

In a seminal paper of Charikar et al. on the smallest grammar problem, t...
research
07/17/2018

A tight lower bound for the hardness of clutters

A clutter (or antichain or Sperner family) L is a pair (V,E), where V...
research
07/16/2021

Robust Online Control with Model Misspecification

We study online control of an unknown nonlinear dynamical system that is...

Please sign up or login with your details

Forgot password? Click here to reset