A bibliography on digital and computational convexity (1961-1988)

DOI10.1109/34.16713zbMath0659.68129OpenAlexW2170802226MaRDI QIDQ3809320

Christian Ronse

Publication date: 1989

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/34.16713

zbMATH Keywords

complexityBibliographycomputational geometrystraightnessconvex hull algorithmsdigital geometry. convexity in relation to computer science

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Axiomatic and generalized convexity (52A01) Bibliographies for mathematics in general (00A15) General convexity (52A99)

Related Items (13)

An envelope operator for full convexity to define polyhedral models in digital spaces ⋮ Full convexity for polyhedral models in digital spaces ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ A \(Q\)-convexity vector descriptor for image analysis ⋮ Shape of an arbitrary finite point set in \(\mathbb{R}^2\) ⋮ An alternative definition for digital convexity ⋮ On the recognition of digital circles in linear time ⋮ An alternative definition for digital convexity ⋮ Digital convex + unimodular mapping = 8-connected (all points but one 4-connected) ⋮ Efficient Algorithms to Test Digital Convexity ⋮ Estimation of the envelope of a point set with loose boundaries ⋮ Random generation of \(Q\)-convex sets ⋮ On the flatness of digital hyperplanes

This page was built for publication: A bibliography on digital and computational convexity (1961-1988)