A linear time algorithm for computing the convex hull of an ordered crossing polygon

DOI10.1016/0031-3203(84)90086-4zbMath0537.68088OpenAlexW2015001026MaRDI QIDQ792775

Subir Kumar Ghosh, Rudrapatna K. Shyamasundar

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0031-3203(84)90086-4

zbMATH Keywords

convex hulllinear time algorithmcomputational geometryordered crossing polygon

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Pattern recognition, speech recognition (68T10) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• A linear time algorithm for obtaining the convex hull of a simple polygon
• A linear algorithm for finding the convex hull of a simple polygon
• On finding the convex hull of a simple polygon
• Approximation algorithms for convex hulls
• Some Upper Bounds on Error Probability for Multiclass Pattern Recognition
• Measuring Concavity on a Rectangular Mosaic

This page was built for publication: A linear time algorithm for computing the convex hull of an ordered crossing polygon