Multiscale Discrete Geometry

DOI10.1007/978-3-642-04397-0_11zbMath1261.68139OpenAlexW2114995981MaRDI QIDQ3648778

Mouhammad Said, Fabien Feschet, Jacques-Olivier Lachaud

Publication date: 1 December 2009

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04397-0_11

zbMATH Keywords

multi-resolutionStern-Brocot treedigital straight segment recognitionstandard linesmultiscale geometrydigital contours

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line ⋮ Dynamic Minimum Length Polygon ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Shape from Silhouettes in Discrete Space ⋮ Remainder approach for the computation of digital straight line subsegment characteristics ⋮ Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity ⋮ Analytical description of digital intersections: minimal parameters and multiscale representation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of images
• Canonical representations of discrete curves
• An elementary algorithm for digital arc segmentation
• Discrete Representation of Straight Lines
• Revisiting Digital Straight Segment Recognition