Convex hull properties and algorithms
From MaRDI portal
Recommendations
Cites work
- A Lower Bound to Finding Convex Hulls
- A new active convex hull model for image regions
- Affine invariant comparison of point-sets using convex hulls and Hausdorff distances
- An Algorithm for Convex Polytopes
- An efficient algorithm for determining the convex hull of a finite planar set
- Convex hull based skew estimation
- Convex hulls of finite sets of points in two and three dimensions
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Maintenance of configurations in the plane
- On the identification of the convex hull of a finite set of points in the plane
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Robust algorithms for constructing strongly convex hulls in parallel.
- Space-efficient planar convex hull algorithms
- The quickhull algorithm for convex hulls
Cited in
(9)- A new algorithm for computing the convex hull of a planar point set
- QuickhullDisk: a faster convex hull algorithm for disks
- An efficient convex hull algorithm using affine transformation in planar point set
- Algorithms to determine the edges of a convex hull from its vertices
- Applications of a semi-dynamic convex hull algorithm
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- scientific article; zbMATH DE number 4051000 (Why is no real title available?)
- scientific article; zbMATH DE number 4119626 (Why is no real title available?)
- A variational convex hull algorithm
This page was built for publication: Convex hull properties and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984371)