Computational geometry: an introduction
Computational geometry: an introduction
The ultimate planar convex hull algorithm
SIAM Journal on Computing
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Threshold Decomposition of Gray-Scale Morphology into Binary Morphology
IEEE Transactions on Pattern Analysis and Machine Intelligence
Threshold Superposition in Morphological Image Analysis Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Strong and weak convex hulls in non-Euclidean metric: theory and application
Pattern Recognition Letters
Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles
IEEE Transactions on Pattern Analysis and Machine Intelligence
Periodic lines: Definition, cascades, and application to granulometries
Pattern Recognition Letters
Grey scale convex hulls: definition, implementation and application
ISMM '98 Proceedings of the fourth international symposium on Mathematical morphology and its applications to image and signal processing
Direct Gray-Scale Extraction of Features for Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Image Analysis: Principles and Applications
Morphological Image Analysis: Principles and Applications
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Measuring Concavity on a Rectangular Mosaic
IEEE Transactions on Computers
Digital Straight Line Segments
IEEE Transactions on Computers
Algorithm for computer control of a digital plotter
IBM Systems Journal
Maximum Likelihood Estimation of Markov-Process Blob Boundaries in Noisy Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Straight Lines and Convexity of Digital Regions
IEEE Transactions on Pattern Analysis and Machine Intelligence
A historical note on convex hull finding algorithms
Pattern Recognition Letters
On the ultimate convex hull algorithm in practice
Pattern Recognition Letters
| Hi-index | 0.00 |
The convex hull of a set is the smallest convex set containing this set. In ℜ 2, this definition is equivalent to the intersection of all half-planes containing the set. We show that this latter definition is nothing but an algebraic closing that can be applied to 2-D grey scale images. The resulting grey scale image is convex, in the sense that all its cross-sections are convex. An efficient translation-invariant implementation, leading to a decreasing family of convex sets that converges to an exact discrete convex hull, is proposed.