Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays

by   Man-Kwun Chiu, et al.

We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in ℤ^d. The construction must be consistent (that is, satisfy the natural extension of the Euclidean axioms) while resembling them as much as possible. Previous work has shown asymptotically tight results in two dimensions with Θ(log N) error, where resemblance between segments is measured with the Hausdorff distance, and N is the L_1 distance between the two points. This construction was considered tight because of a Ω(log N) lower bound that applies to any consistent construction in ℤ^2. In this paper we observe that the lower bound does not directly extend to higher dimensions. We give an alternative argument showing that any consistent construction in d dimensions must have Ω(log^1/(d-1) N) error. We tie the error of a consistent construction in high dimensions to the error of similar weak constructions in two dimensions (constructions for which some points need not satisfy all the axioms). This not only opens the possibility for having constructions with o(log N) error in high dimensions, but also opens up an interesting line of research in the tradeoff between the number of axiom violations and the error of the construction. In order to show our lower bound, we also consider a colored variation of the concept of discrepancy of a set of points that we find of independent interest.


Optimal Bounds for Weak Consistent Digital Rays in 2D

Representation of Euclidean objects in a digital space has been a focus ...

Euclidean Steiner Spanners: Light and Sparse

Lightness and sparsity are two natural parameters for Euclidean (1+ε)-sp...

Optimal periodic L_2-discrepancy and diaphony bounds for higher order digital sequences

We present an explicit construction of infinite sequences of points (x_0...

Light Euclidean Steiner Spanners in the Plane

Lightness is a fundamental parameter for Euclidean spanners; it is the r...

Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound

In STOC'95 [ADMSS'95] Arya et al. showed that any set of n points in ℝ^d...

Light Euclidean Spanners with Steiner Points

The FOCS'19 paper of Le and Solomon, culminating a long line of research...

Locating arrays with mixed alphabet sizes

Locating arrays (LAs) can be used to detect and identify interaction fau...

Please sign up or login with your details

Forgot password? Click here to reset