High dimensional consistent digital segments

Man Kwun Chiu, Matias Korman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


We consider the problem of digitalizing Euclidean line segments from ℝd to ℤd. Christ et al. (DCG, 2012) showed how to construct a set of consistent digital segments (CDS) for d = 2: a collection of segments connecting any two points in ℤ2 that satisfies the natural extension of the Euclidean axioms to ℤ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 consistent digital rays CDR in ℤ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 et al.

Original languageEnglish
Title of host publication33rd International Symposium on Computational Geometry, SoCG 2017
EditorsMatthew J. Katz, Boris Aronov
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Number of pages2805
ISBN (Electronic)9783959770385
Publication statusPublished - 2017 Jun 1
Event33rd International Symposium on Computational Geometry, SoCG 2017 - Brisbane, Australia
Duration: 2017 Jul 42017 Jul 7

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Other33rd International Symposium on Computational Geometry, SoCG 2017


  • Computer vision
  • Consistent digital line segments
  • Digital geometry

ASJC Scopus subject areas

  • Software

Cite this