About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length

DOI10.1007/978-3-319-09955-2_2zbMath1419.68197OpenAlexW124022788MaRDI QIDQ3190061

Yan Gerard, Antoine Vacavant

Publication date: 15 September 2014

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09955-2_2

zbMATH Keywords

complexitycurvelengthcovercardinalitydigitization

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length

This page was built for publication: About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length