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/02331930802434732zbMATH Open1184.90121OpenAlexW2054586770WikidataQ57659445 ScholiaQ57659445MaRDI QIDQ3553761FDOQ3553761
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
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
- An efficient algorithm for determining the convex hull of a finite planar set
- Finding the convex hull of a simple polygon
- Computational Geometry in C
- A fast convex hull algorithm
- 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
- 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
- Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
- Zur Lösung eines zermelosehen nayigationsproblems
Cited In (14)
- Title not available (Why is that?)
- QuickhullDisk: a faster convex hull algorithm for disks
- 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 convex hull algorithm for solving a location problem
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- 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)
