An O(n\log ^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem

DOI10.1137/0220016zbMATH Open0722.68064OpenAlexW2065697367MaRDI QIDQ3210183FDOQ3210183

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

Recommendations

• A time-optimal parallel algorithm for three-dimensional convex hulls
• scientific article; zbMATH DE number 724218
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• The Ultimate Planar Convex Hull Algorithm?
• An efficient and numerically correct algorithm for the 2D convex hull problem

zbMATH Keywords

computational geometryconvex hullthree dimensionsoutput sensitive

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (9)

• Title not available (Why is that?)
• Derandomizing an output-sensitive convex hull algorithm in three dimensions
• Title not available (Why is that?)
• Constructing the convex hull of a partially sorted set of points
• A time-optimal parallel algorithm for three-dimensional convex hulls
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Output-sensitive results on convex hulls, extreme points, and related problems
• Title not available (Why is that?)
• An Output-Sensitive Convex Hull Algorithm for Planar Objects

This page was built for publication: An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210183)