Discrete convexity: Definition, parametrization, and compatibility with continuous convexity

DOI10.1016/S0734-189X(83)80047-4zbMath0535.52010OpenAlexW1997246540MaRDI QIDQ3319349

Jean-Marc Chassery

Publication date: 1983

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0734-189x(83)80047-4

zbMATH Keywords

discrete spacemeasurement of convexity

Mathematics Subject Classification ID

General convexity (52A99)

Related Items (5)

Efficiently testing digital convexity and recognizing digital convex polygons ⋮ The supercover of an \(m\)-flat is a discrete analytical object ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ Digital convex + unimodular mapping = 8-connected (all points but one 4-connected) ⋮ Efficient Algorithms to Test Digital Convexity

This page was built for publication: Discrete convexity: Definition, parametrization, and compatibility with continuous convexity