Polygonal entropy: A convexity measure
From MaRDI portal
Publication:4310460
DOI10.1016/0167-8655(89)90093-7zbMath0800.68794OpenAlexW2017159829MaRDI QIDQ4310460
Publication date: 30 October 1994
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8655(89)90093-7
Related Items (12)
Beyond the Hausdorff metric in digital topology ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Measuring squareness and orientation of shapes ⋮ A measure of \(Q\)-convexity for shape analysis ⋮ A \(Q\)-convexity vector descriptor for image analysis ⋮ Measuring linearity of planar point sets ⋮ A Bound on a Convexity Measure for Point Sets ⋮ On the Beer index of convexity and its variants ⋮ TURNING SHAPE DECISION PROBLEMS INTO MEASURES ⋮ Approximate convex decomposition of polygons ⋮ A new polyhedral element for the analysis of hexahedral-dominant finite element models and its application to nonlinear solid mechanics problems ⋮ A Spatial Convexity Descriptor for Object Enlacement
This page was built for publication: Polygonal entropy: A convexity measure
