The complexity of incremental convex hull algorithms in \(R^ d\)
From MaRDI portal
Publication:800085
DOI10.1016/0020-0190(84)90084-XzbMath0549.68036MaRDI QIDQ800085
Publication date: 1984
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (10)
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 ⋮ Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification ⋮ Unnamed Item ⋮ A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ A new variational approach based on level-set function for convex hull problem with outliers ⋮ Multi-core Implementations of Geometric Algorithms ⋮ An approximate algorithm for computing multidimensional convex hulls ⋮ Quicker than Quickhull
Cites Work
This page was built for publication: The complexity of incremental convex hull algorithms in \(R^ d\)
