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

DOI10.1016/0031-3203(84)90086-4zbMATH Open0537.68088OpenAlexW2015001026MaRDI QIDQ792775FDOQ792775

Authors: Subir Kumar Ghosh, R. 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

computational geometryconvex hulllinear time algorithmordered crossing polygon

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On finding the convex hull of a simple polygon
• Approximation algorithms for convex hulls
• A linear algorithm for finding the convex hull of a simple polygon
• Measuring Concavity on a Rectangular Mosaic
• A linear time algorithm for obtaining the convex hull of a simple polygon
• Some Upper Bounds on Error Probability for Multiclass Pattern Recognition

Cited In (3)

• LATIN 2004: Theoretical Informatics
• Simplified linear-time Jordan sorting and polygon clipping
• A linear-time algorithm to compute the triangular hull of a digital object

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

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