Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal Bounds for Weak Consistent Digital Rays in 2D

Published 6 May 2022 in cs.CG | (2205.03450v1)

Abstract: Representation of Euclidean objects in a digital space has been a focus of research for over 30 years. Digital line segments are particularly important as other digital objects depend on their definition (e.g., digital convex objects or digital star-shaped objects). It may be desirable for the digital line segment systems to satisfy some nice properties that their Euclidean counterparts also satisfy. The system is a consistent digital line segment system (CDS) if it satisfies five properties, most notably the subsegment property (the intersection of any two digital line segments should be connected) and the prolongation property (any digital line segment should be able to be extended into a digital line). It is known that any CDS must have $\Omega(\log n)$ Hausdorff distance to their Euclidean counterparts, where $n$ is the number of grid points on a segment. In fact this lower bound even applies to consistent digital rays (CDR) where for a fixed $p \in \mathbb{Z}2$, we consider the digital segments from $p$ to $q$ for each $q \in \mathbb{Z}2$. In this paper, we consider families of weak consistent digital rays (WCDR) where we maintain four of the CDR properties but exclude the prolongation property. In this paper, we give a WCDR construction that has optimal Hausdorff distance to the exact constant. That is, we give a construction whose Hausdorff distance is 1.5 under the $L_\infty$ metric, and we show that for every $\epsilon > 0$, it is not possible to have a WCDR with Hausdorff distance at most $1.5 - \epsilon$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.