A simple and efficient preprocessing step for convex hull problem

DOI10.1142/S179383092350091XMaRDI QIDQ6983404zbMATH OpenFDO

Authors Mohammad Heydari, Ashkan Khalifeh, Laxmi Rathour

Publication date 15 May 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S179383092350091X

zbMATH Keywords

convex hullrecursive algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A fast and efficient algorithm for determining the connected orthogonal convex hulls
• A fast convex hull algorithm
• A linear-time algorithm to compute the triangular hull of a digital object
• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
• Affine invariant comparison of point-sets using convex hulls and Hausdorff distances
• An efficient algorithm for determining the convex hull of a finite planar set
• Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
• Fast linear expected-time algorithms for computing maxima and convex hulls
• Method of orienting curves for determining the convex hull of a finite set of points in the plane
• Randomized quickhull
• Robust gift wrapping for the three-dimensional convex hull
• The quickhull algorithm for convex hulls

This page was built for publication: A simple and efficient preprocessing step for convex hull problem

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