Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

High Dimensional Consistent Digital Segments (1612.02483v1)

Published 7 Dec 2016 in cs.CG

Abstract: We consider the problem of digitalizing Euclidean line segments from $\mathbb{R}d$ to $\mathbb{Z}d$. Christ {\em et al.} (DCG, 2012) showed how to construct a set of {\em consistent digital segment} (CDS) for $d=2$: a collection of segments connecting any two points in $\mathbb{Z}2$ that satisfies the natural extension of the Euclidean axioms to $\mathbb{Z}d$. In this paper we study the construction of CDSs in higher dimensions. We show that any total order can be used to create a set of {\em consistent digital rays} CDR in $\mathbb{Z}d$ (a set of rays emanating from a fixed point $p$ that satisfies the extension of the Euclidean axioms). We fully characterize for which total orders the construction holds and study their Hausdorff distance, which in particular positively answers the question posed by Christ {\em et al.}.

Citations (2)

Summary

We haven't generated a summary for this paper yet.