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

DOI10.1007/s00454-021-00349-6OpenAlexW3037616247MaRDI QIDQ2172660

Man-Kwun Chiu, Martin Suderland, Matias Korman, Takeshi Tokuyama

Publication date: 16 September 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.14059

zbMATH Keywords

computer visiondiscrepancydigital geometryconsistent digital line segments

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Complexity and performance of numerical algorithms (65Y20) Artificial intelligence (68Txx)

Cites Work

• Consistent digital line segments
• Balanced two-colorings of finite sets in the square. I
• Digital straightness -- a review
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Geodesic geometry on graphs
• Constructing Consistent Digital Line Segments
• A Characterization of Consistent Digital Line Segments in ℤ2
• High Dimensional Consistent Digital Segments
• EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
• On the Structure of Unique Shortest Paths in Graphs
• Irregularities of distribution, VII
• Consistent digital rays
• Geometric discrepancy. An illustrated guide

This page was built for publication: Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays