The complexity of incremental convex hull algorithms in R^ d

DOI10.1016/0020-0190(84)90084-XzbMATH Open0549.68036MaRDI QIDQ800085FDOQ800085

Authors: Michael Kallay 

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

incremental convex hull algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

• Title not available (Why is that?)
• An optimal real-time algorithm for planar convex hulls
• Title not available (Why is that?)

Cited In (14)

• An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
• \(\alpha\)-concave hull, a generalization of convex hull
• QuickhullDisk: a faster convex hull algorithm for disks
• An approximate algorithm for computing multidimensional convex hulls
• Title not available (Why is that?)
• Quicker than Quickhull
• Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification
• Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
• A new variational approach based on level-set function for convex hull problem with outliers
• A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
• A filtering technique for fast convex hull construction in \(\mathbb{R}^2\)
• Title not available (Why is that?)
• Multi-core Implementations of Geometric Algorithms
• Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas

This page was built for publication: The complexity of incremental convex hull algorithms in \(R^ d\)

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