Computing the convex hull in a hammock

DOI10.1016/0020-0255(92)90045-AzbMath0764.68184MaRDI QIDQ1177390

S. Singh

Publication date: 26 June 1992

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

convex hullline-segment intersections

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Convex hull of a finite set of points in two dimensions
• A fast convex hull algorithm
• Reporting and counting segment intersections
• An efficient algorithm for determining the convex hull of a finite planar set
• The Ultimate Planar Convex Hull Algorithm?
• Computing the convex hull of line intersections
• Convex hulls of finite sets of points in two and three dimensions
• An optimal real-time algorithm for planar convex hulls