Finding the convex hull of a simple polygon in linear time

DOI10.1016/0031-3203(86)90043-9zbMath0633.68088OpenAlexW2051202323MaRDI QIDQ1096406

Tony C. Woo, Sung Yong Shin

Publication date: 1986

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

Full work available at URL: http://hdl.handle.net/2027.42/26420

zbMATH Keywords

convex hullcomputational geometrylinear algorithmssimply-connected polygon

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (4)

Convex hull of a planar set of straight and circular line segments ⋮ Numerical stability of a convex hull algorithm for simple polygons ⋮ Convex hulls of objects bounded by algebraic curves ⋮ An Output-Sensitive Convex Hull Algorithm for Planar Objects

Cites Work

• On the conditions for success of Sklansky's convex hull algorithm
• 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
• Convex hull of a finite set of points in two dimensions
• On finding the convex hull of a simple polygon
• A counterexample to an algorithm for computing monotone hulls of simple polygons
• Measuring Concavity on a Rectangular Mosaic
• Finding the convex hull of a simple polygon
• Finding the convex hull of a simple polygon

This page was built for publication: Finding the convex hull of a simple polygon in linear time