An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
From MaRDI portal
Publication:3210183
DOI10.1137/0220016zbMath0722.68064MaRDI QIDQ3210183
Herbert Edelsbrunner, Weiping Shi
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220016
68Q25: Analysis of algorithms and problem complexity
Related Items
An Output-Sensitive Convex Hull Algorithm for Planar Objects, Derandomizing an output-sensitive convex hull algorithm in three dimensions, Constructing the convex hull of a partially sorted set of points, Optimal output-sensitive convex hull algorithms in two and three dimensions, Output-sensitive results on convex hulls, extreme points, and related problems, A time-optimal parallel algorithm for three-dimensional convex hulls