An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves

DOI10.1080/02331934.2011.623163zbMath1280.65020WikidataQ57659433 ScholiaQ57659433MaRDI QIDQ2868910

Le Hong Trang, Phan Thanh An

Publication date: 19 December 2013

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

geometric computing; convex hull algorithms; method of orienting curves; gift-wrapping algorithm

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

Related Items

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, An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D, A parallel algorithm based on convexity for the computing of Delaunay tessellation, An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\), QuickhullDisk: a faster convex hull algorithm for disks, Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves, A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D, Unnamed Item

Cites Work

• Robust gift wrapping for the three-dimensional convex hull
• On the upper-bound conjecture for convex polytopes
• The implementation of an algorithm to find the convex hull of a set of three-dimensional points
• Method of orienting curves for determining 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 constraints¹
• 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