The complexity of incremental convex hull algorithms in R^ d
From MaRDI portal
(Redirected from Publication:800085)
The complexity of incremental convex hull algorithms in \(R^ d\)
The complexity of incremental convex hull algorithms in \(R^ d\)
Cites work
Cited in
(16)- An approximate algorithm for computing multidimensional convex hulls
- \(\alpha\)-concave hull, a generalization of convex hull
- Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification
- A new variational approach based on level-set function for convex hull problem with outliers
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\)
- QuickhullDisk: a faster convex hull algorithm for disks
- Quicker than Quickhull
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- Multi-core Implementations of Geometric Algorithms
- scientific article; zbMATH DE number 6846375 (Why is no real title available?)
- Streaming algorithms for planar convex hulls
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
- Inner -approximation of the convex hull of finite sets
- Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
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)
