A convex hull algorithm for planar simple polygons

DOI10.1016/0031-3203(85)90027-5zbMath0569.68055OpenAlexW2069373610MaRDI QIDQ1060850

Marian Orlowski

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0031-3203(85)90027-5

zbMATH Keywords

linear convex hull algorithm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Extension theory approach to scattering and annihilation in the \(\overline{p}d\) system

Cites Work

• On the conditions for success of Sklansky's convex hull algorithm
• A linear algorithm for finding the convex hull of a simple polygon
• On finding the convex hull of a simple polygon
• Measuring Concavity on a Rectangular Mosaic

This page was built for publication: A convex hull algorithm for planar simple polygons