An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
From MaRDI portal
Publication:827092
DOI10.1007/s11075-020-00873-1zbMath1457.65011OpenAlexW3012620846MaRDI QIDQ827092
Phan Thanh An, Nguyen Kieu Linh, Nam Dũng Hoàng
Publication date: 6 January 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-00873-1
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical interpolation (65D05)
Related Items (2)
Unnamed Item ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
Uses Software
Cites Work
- Unnamed Item
- A parallel algorithm based on convexity for the computing of Delaunay tessellation
- The complexity of incremental convex hull algorithms in \(R^ d\)
- Convex hull based skew estimation
- Convex hull of a finite set of points in two dimensions
- 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
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- QuickhullDisk: a faster convex hull algorithm for disks
- Quicker than Quickhull
- On the upper-bound conjecture 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
- The Ultimate Planar Convex Hull Algorithm?
- Method of orienting curves for solving optimal control problems with state constraints1
- A New Convex Hull Algorithm for Planar Sets
- Computational Geometry in C
- Solving a class of regular optimal control problems with state constraints by the method of orienting curves
- Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
- Some remarks on the method of orienting curves∗
- A convex Hull algorithm for solving a location problem
- Convex Polytopes
- An Algorithm for Convex Polytopes
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\)
