Graham-Scan

Algorithm for calculating a convex hull around a point cloud

https://de.wikipedia.org/wiki/Graham_Scan

Version 1.0.0 (4.15 KB)
179 Downloads
(0)
27 Jan 2020

You are now following this Submission

Graham's scan is a method of finding the convex hull of a finite set of points
in the plane with time complexity O(n log n). It is named after Ronald Graham, who published
the original algorithm in 1972.[1] The algorithm finds all vertices of the convex hull ordered along its boundary.
It uses a stack to detect and remove concavities in the boundary efficiently.
http://www.dbs.ifi.lmu.de/Lehre/GIS/WS1415/Skript/GIS_WS14_05_part2.pdf (GERMAN)

Andreas Bernatzky 19.08.2019

Cite As

Andreas Bernatzky (2026). Graham-Scan (https://github.com/TypHo22/Graham-Scan), GitHub. Retrieved .

Categories

Find more on Process Point Clouds in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Open in new tab

Versions that use the GitHub default branch cannot be downloaded

Version Published Release Notes
1.0.0

To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.