Computing deviations from convexity in polygons

DOI10.1016/0167-8655(93)90067-NMaRDI QIDQ4274674zbMATH OpenFDO

Authors Laurence Boxer

Publication date 3 January 1994

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(93)90067-N

zbMATH Keywords

convexityHausdorff metric

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 177850
• scientific article; zbMATH DE number 1182912
• Computing the extreme distances between two convex polygons
• On computing the degree of convexity of polyominoes
• Approximate convex decomposition of polygons
• Approximate convex decomposition of polygons
• Determining convex polygons from their covariograms
• About convexity of polygons

Cited in

(15)

• A Q-convexity vector descriptor for image analysis
• Measuring squareness and orientation of shapes
• \(G\)-deviations of polygons and their applications in electric power engineering
• A measure of \(Q\)-convexity for shape analysis
• A fast and efficient algorithm for determining the connected orthogonal convex hulls
• Procedures for calculating the nonconvexity measures of a plane set
• scientific article; zbMATH DE number 2073542 (Why is no real title available?)
• TURNING SHAPE DECISION PROBLEMS INTO MEASURES
• Beyond the Hausdorff metric in digital topology
• A spatial convexity descriptor for object enlacement
• Shape elongation from optimal encasing rectangles
• Comparing Convexity Measures
• Rotational and rotation-free multidirectional Q-concavity shape descriptors
• A Hu moment invariant as a shape circularity measure
• Measuring linearity of planar point sets

This page was built for publication: Computing deviations from convexity in polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274674)