Matlab_Convexhull
说明： 基于一系列障碍物点阵，利用Graham and Kirkpatrick算法构建多边形
(Based on a series of obstacle lattice, we construct polygons by using Graham and Kirkpatrick algorithm.)
(Based on a series of obstacle lattice, we construct polygons by using Graham and Kirkpatrick algorithm.)
文件列表:
Convexhull report.pdf (313642, 2016-02-28)
examples (0, 2016-02-28)
examples\1.png (21525, 2016-02-28)
examples\2.png (24735, 2016-02-28)
examples\3.png (28099, 2016-02-28)
examples\4.png (33547, 2016-02-28)
src (0, 2016-02-28)
src\Grehem.m (2763, 2016-02-28)
src\convexHull.m (579, 2016-02-28)
src\main.m (184, 2016-02-28)
src\square.m (105, 2016-02-28)
src\start_convexhull.m (763, 2016-02-28)
src\write2file.m (619, 2016-02-28)
examples (0, 2016-02-28)
examples\1.png (21525, 2016-02-28)
examples\2.png (24735, 2016-02-28)
examples\3.png (28099, 2016-02-28)
examples\4.png (33547, 2016-02-28)
src (0, 2016-02-28)
src\Grehem.m (2763, 2016-02-28)
src\convexHull.m (579, 2016-02-28)
src\main.m (184, 2016-02-28)
src\square.m (105, 2016-02-28)
src\start_convexhull.m (763, 2016-02-28)
src\write2file.m (619, 2016-02-28)
## Description
This Matlab project is concetrated around convex hull construction methods. The original set of points can have different distributions.
Two methods were used : Graham and Kirkpatrick methods together. Also there is a comparison with the standard Matlab function convexhull.
More detailed information is in CONVEXHULL REPORT.pdf (in Russian)
## HOW TO USE
The way of distribution is given in WRITE2FILE.m
Start file is START_CONVEXHULL.m
近期下载者：
相关文件：
收藏者：