Method of orienting curves for determining the convex hull of a finite set of points in the plane
From MaRDI portal
Publication:3553761
DOI10.1080/02331930802434732zbMath1184.90121OpenAlexW2054586770WikidataQ57659445 ScholiaQ57659445MaRDI QIDQ3553761
Publication date: 21 April 2010
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930802434732
Related Items
A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves ⋮ Unnamed Item ⋮ Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding ⋮ Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set ⋮ Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ A convex Hull algorithm for solving a location problem ⋮ An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D ⋮ An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves ⋮ Quicker than Quickhull
Cites Work
- A fast convex hull algorithm
- 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
- 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
- Computational Geometry in C
- 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
- Finding the convex hull of a simple polygon
