An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in R^n
From MaRDI portal
Publication:827092
Recommendations
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- scientific article; zbMATH DE number 123809
- scientific article; zbMATH DE number 123932
- A new representation and algorithm for constructing convex hulls in higher dimensional spaces
- Robust gift wrapping for the three-dimensional convex hull
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A New Convex Hull Algorithm for Planar Sets
- A convex hull algorithm for solving a location problem
- A parallel algorithm based on convexity for the computing of Delaunay tessellation
- An Algorithm for Convex Polytopes
- An efficient algorithm for determining the convex hull of a finite planar set
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- Computational Geometry in C
- Convex Polytopes
- Convex hull based skew estimation
- Convex hull of a finite set of points in two dimensions
- Method of orienting curves for solving optimal control problems with state constraints1
- On the upper-bound conjecture for convex polytopes
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Quicker than Quickhull
- QuickhullDisk: a faster convex hull algorithm for disks
- Robust gift wrapping for the three-dimensional convex hull
- Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves
- Solving a class of regular optimal control problems with state constraints by the method of orienting curves
- Some remarks on the method of orienting curves∗
- The Ultimate Planar Convex Hull Algorithm?
- The complexity of incremental convex hull algorithms in \(R^ d\)
- Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
Cited in
(8)- scientific article; zbMATH DE number 7499212 (Why is no real title available?)
- Inner -approximation of the convex hull of finite sets
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- 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\)
This page was built for publication: An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827092)
