An optimal real-time algorithm for planar convex hulls
From MaRDI portal
Publication:4190154
DOI10.1145/359131.359132zbMath0404.68069MaRDI QIDQ4190154
Publication date: 1979
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359131.359132
Computational Complexity; Convex Hull; Computational Geometry; Planar Set of Points; Real-Time Algorithms
68Q25: Analysis of algorithms and problem complexity
52A10: Convex sets in (2) dimensions (including convex curves)
68R99: Discrete mathematics in relation to computer science
68W99: Algorithms in computer science
Related Items
Convex hull of a planar set of straight and circular line segments, Computing the convex hull in a hammock, Applications of a semi-dynamic convex hull algorithm, Geometrical tools in classification, Optimal, output-sensitive algorithms for constructing planar hulls in parallel, Connected component and simple polygon intersection searching, The convex hull of a set of convex polygons