Quicker than Quickhull
From MaRDI portal
Publication:2354631
DOI10.1007/s10013-014-0067-1zbMath1319.65018OpenAlexW2037535344MaRDI QIDQ2354631
Nguyen Kieu Linh, Nam Dũng Hoàng
Publication date: 20 July 2015
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10013-014-0067-1
Related Items (4)
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Convex-hull algorithms: implementation, testing, and experimentation ⋮ A convex Hull algorithm for solving a location problem
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of incremental convex hull algorithms in \(R^ d\)
- Convex hull based skew estimation
- Another efficient algorithm for convex hulls in two dimensions
- Convex hull of a finite set of points in two dimensions
- A fast convex hull algorithm
- 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
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- The Ultimate Planar Convex Hull Algorithm?
- Zur Lösung eines zermelosehen nayigationsproblems
- Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
- 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
- The method of orienting curves and its application to manipulator trajectory planning
- Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
- Some remarks on the method of orienting curves∗
- An Algorithm for Convex Polytopes
This page was built for publication: Quicker than Quickhull
