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