Method of orienting curves for determining the convex hull of a finite set of points in the plane

DOI10.1080/02331930802434732MaRDI QIDQ3553761zbMATH OpenOpenAlexWikidataFDO

Authors Phan Thanh An

Publication date 21 April 2010

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930802434732

zbMATH Keywords

convex hullmethod of orienting curvesGraham's convex hull algorithm

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
• scientific article; zbMATH DE number 1322850
• The Convex Hull of Rational Plane Curves
• Optimal computation of finitely oriented convex hulls
• Relative convex hull determination from convex hulls in the plane

Cites work

• A fast convex hull algorithm
• An efficient algorithm for determining the convex hull of a finite planar set
• Computational Geometry in C
• Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
• Finding the convex hull of a simple polygon
• Method of orienting curves for solving optimal control problems with state constraints¹
• On the identification of the convex hull of a finite set of points in the plane
• The method of orienting curves and its application to manipulator trajectory planning
• Zur Lösung eines zermelosehen nayigationsproblems
• Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven

Cited in

(14)

• QuickhullDisk: a faster convex hull algorithm for disks
• scientific article; zbMATH DE number 7499212 (Why is no real title available?)
• Some computational aspects of geodesic convex sets in a simple polygon
• An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
• A fast and efficient algorithm for determining the connected orthogonal convex hulls
• A convex hull algorithm for solving a location problem
• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
• Quicker than Quickhull
• An exact algorithm for minimizing a sum of Euclidean norms on rays in 2D and 3D
• 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
• Determining the orientation of closed planar curves
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations

This page was built for publication: Method of orienting curves for determining the convex hull of a finite set of points in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553761)