Convex hulls of finite sets of points in two and three dimensions

DOI10.1145/359423.359430zbMath0342.68030MaRDI QIDQ4110607

Publication date: 1977

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359423.359430

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

68T10: Pattern recognition, speech recognition

52A10: Convex sets in (2) dimensions (including convex curves)

52A15: Convex sets in (3) dimensions (including convex surfaces)

68N01: General topics in the theory of software

68W99: Algorithms in computer science

Related Items

Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée, LR-visibility in polygons, Approximating spheres and sphere patches, Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays, Small-dimensional linear programming and convex hulls made easy, Computing the convex hull in a hammock, Bisections and ham-sandwich cuts of convex polygons and polyhedra, The \(\gamma\)-neighborhood graph, Geometric medians, Fast linear expected-time algorithms for computing maxima and convex hulls, On the randomized construction of the Delaunay tree, An approximate algorithm for computing multidimensional convex hulls, An optimal convex hull algorithm in any fixed dimension, Robust gift wrapping for the three-dimensional convex hull, Derandomizing an output-sensitive convex hull algorithm in three dimensions, Computing depth contours of bivariate point clouds, Optimal, output-sensitive algorithms for constructing planar hulls in parallel, Representing geometric structures in \(d\) dimensions: Topology and order, Optimal output-sensitive convex hull algorithms in two and three dimensions, Output-sensitive results on convex hulls, extreme points, and related problems, Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\), A time-optimal parallel algorithm for three-dimensional convex hulls, Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications, The convex hull of a set of convex polygons