Constructing the convex hull of a partially sorted set of points

DOI10.1016/0925-7721(93)90023-YzbMath0797.68159MaRDI QIDQ1803271

Michael T. Goodrich

Publication date: 29 June 1993

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

convex hullcomputational geometrypartially sorted set

Mathematics Subject Classification ID

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

Related Items (1)

Fast randomized parallel methods for planar convex hull construction

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the convex hull of a sorted point set in parallel
• Parallel computational geometry
• An optimal convex hull algorithm in any fixed dimension
• Applications of random sampling in computational geometry. II
• An efficient algorithm for determining the convex hull of a finite planar set
• An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On the convex layers of a planar set
• The Ultimate Planar Convex Hull Algorithm?
• Linear Programming in Linear Time When the Dimension Is Fixed
• A Lower Bound to Finding Convex Hulls
• Finding the convex hull of a simple polygon

This page was built for publication: Constructing the convex hull of a partially sorted set of points