Optimal Bounds for Weak Consistent Digital Rays in 2D

Authors Matt Gibson-Lopez , Serge Zamarripa



PDF
Thumbnail PDF

File

LIPIcs.SWAT.2022.26.pdf
  • Filesize: 0.93 MB
  • 20 pages

Document Identifiers

Author Details

Matt Gibson-Lopez
  • Department of Computer Science, The University of Texas at San Antonio, TX, USA
Serge Zamarripa
  • Department of Computer Science, The University of Texas at San Antonio, TX, USA

Cite AsGet BibTex

Matt Gibson-Lopez and Serge Zamarripa. Optimal Bounds for Weak Consistent Digital Rays in 2D. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 227, pp. 26:1-26:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.SWAT.2022.26

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 Ω(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 ∈ ℤ², we consider the digital segments from p to q for each q ∈ ℤ². 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 - ε.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Digital Geometry
  • Consistent Digital Rays

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Man-Kwun Chiu and Matias Korman. High dimensional consistent digital segments. SIAM J. Discret. Math., 32(4):2566-2590, 2018. URL: https://doi.org/10.1137/17M1136572.
  2. Man-Kwun Chiu, Matias Korman, Martin Suderland, and Takeshi Tokuyama. Distance bounds for high dimensional consistent digital rays and 2-d partially-consistent digital rays. In Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, editors, 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), volume 173 of LIPIcs, pages 34:1-34:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ESA.2020.34.
  3. Man-Kwun Chiu, Matias Korman, Martin Suderland, and Takeshi Tokuyama. Distance bounds for high dimensional consistent digital rays and 2-d partially-consistent digital rays. CoRR, abs/2006.14059, 2020. URL: http://arxiv.org/abs/2006.14059.
  4. Iffat Chowdhury and Matt Gibson. A characterization of consistent digital line segments in ℤ². In Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pages 337-348, 2015. URL: https://doi.org/10.1007/978-3-662-48350-3_29.
  5. Iffat Chowdhury and Matt Gibson. Constructing consistent digital line segments. In Evangelos Kranakis, Gonzalo Navarro, and Edgar Chávez, editors, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, volume 9644 of Lecture Notes in Computer Science, pages 263-274. Springer, 2016. URL: https://doi.org/10.1007/978-3-662-49529-2_20.
  6. Tobias Christ, Dömötör Pálvölgyi, and Milos Stojakovic. Consistent digital line segments. Discrete & Computational Geometry, 47(4):691-710, 2012. URL: https://doi.org/10.1007/s00454-012-9411-y.
  7. Jinhee Chun, Matias Korman, Martin Nöllenburg, and Takeshi Tokuyama. Consistent digital rays. Discrete & Computational Geometry, 42(3):359-378, 2009. URL: https://doi.org/10.1007/s00454-009-9166-2.
  8. Michael G. Luby. Grid geometries which preserve properties of euclidean geometry: A study of graphics line drawing algorithms. In Rae A. Earnshaw, editor, Theoretical Foundations of Computer Graphics and CAD, volume 40, pages 397-432, 1988. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail