Graham-Scan

版本 1.0.0 (4.1 KB) 作者: Andreas Bernatzky
Algorithm for calculating a convex hull around a point cloud
160.0 次下载
更新时间 2020/1/27

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

引用格式

Andreas Bernatzky (2024). Graham-Scan (https://github.com/TypHo22/Graham-Scan), GitHub. 检索时间: .

MATLAB 版本兼容性
创建方式 R2019a
兼容任何版本
平台兼容性
Windows macOS Linux
类别
Help CenterMATLAB Answers 中查找有关 Point Cloud Processing 的更多信息
标签 添加标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

无法下载基于 GitHub 默认分支的版本

版本 已发布 发行说明
1.0.0

要查看或报告此来自 GitHub 的附加功能中的问题,请访问其 GitHub 仓库
要查看或报告此来自 GitHub 的附加功能中的问题,请访问其 GitHub 仓库