Optimal Bounds for Weak Consistent Digital Rays in 2D

05/06/2022
by   Matt Gibson-Lopez, et al.
0

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 Ω(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 ∈ℤ^2, we consider the digital segments from p to q for each q ∈ℤ^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_∞ metric, and we show that for every ϵ > 0, it is not possible to have a WCDR with Hausdorff distance at most 1.5 - ϵ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2020

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

We consider the problem of digitalizing Euclidean segments. Specifically...
research
03/30/2021

Approximate Nearest-Neighbor Search for Line Segments

Approximate nearest-neighbor search is a fundamental algorithmic problem...
research
01/20/2018

Determination of Digital Straight Segments Using the Slope

We present a new method for the recognition of digital straight lines ba...
research
11/17/2022

Some Results on Digital Segments and Balanced Words

We exhibit combinatorial results on Christoffel words and binary balance...
research
05/31/2005

An explicit formula for the number of tunnels in digital objects

An important concept in digital geometry for computer imagery is that of...
research
03/08/2021

Digital Convex + Unimodular Mapping =8-Connected (All Points but One 4-Connected)

In two dimensional digital geometry, two lattice points are 4-connected ...

Please sign up or login with your details

Forgot password? Click here to reset