CGAL 4.10.1 官方文档 软件包概述 ——凸包算法类

原文链接:https://doc.cgal.org/latest/Manual/packages.html

译文首发:http://blog.csdn.net/duzixi

 

Convex Hull Algorithms 凸包算法类

 

  •  2D Convex Hulls and Extreme Points 二维凸包和极值点

 

插图:https://doc.cgal.org/latest/Manual/convex_hull.png

 

作者:Susan Hert, Stefan Schirra

 

简介:This package provides functions for computing convex hulls in two dimensions as well as functions for checking if sets of points are strongly convex are not. There are also a number of functions described for computing particular extreme points and subsequences of hull points, such as the lower and upper hull of a set of points.

这个包提供了二维空间中凸包的功能和判别点集是否为强凸的功能。还有一些功能用于计算特定的极值点和包点序列的功能,例如一组点集的下层和上层。

 

Introduced in 引入版本: CGAL 1.0
BibTeX 文献排版cgal:hs-chep2-17b
License 版权许可GPL 
Windows Demo 示例程序See Bounding Volumes
Common Demo Dlls 示例程序动态链接库dlls

 

用户手册英文链接:

https://doc.cgal.org/latest/Convex_hull_2/index.html#Chapter_2D_Convex_Hulls_and_Extreme_Points

 

API参考手册英文连接:

https://doc.cgal.org/latest/Convex_hull_2/group__PkgConvexHull2.html

 

  • 3D Convex Hulls 三维凸包

 

插图:https://doc.cgal.org/latest/Manual/bunny.png

 

作者:Susan Hert , Stefan Schirra

 

简介:This package provides functions for computing convex hulls in three dimensions as well as functions for checking if sets of points are strongly convex or not. One can compute the convex hull of a set of points in three dimensions in two ways: using a static algorithm or using a triangulation to get a fully dynamic computation.

这个包提供了三维空间中凸包的计算功能和检测点集是否为强凸的功能。计算三维空间点集的凸包有两种方法:使用静态算法或用三角剖分进行完全动态计算。

 

Introduced in 引入版本: CGAL 1.1
Depends on 库依赖: The dynamic algorithms depend on 动态算法依赖 3D Triangulations
BibTeX 文献排版cgal:hs-ch3-17b
License 版权许可GPL 
Windows Demo 示例程序Polyhedron demo
Common Demo Dlls 示例程序动态链接库dlls

 

用户手册英文链接:

https://doc.cgal.org/latest/Convex_hull_3/index.html#Chapter_3D_Convex_Hulls

 

API参考手册英文连接:

https://doc.cgal.org/latest/Convex_hull_3/group__PkgConvexHull3.html

 

  •  dD Convex Hulls and Delaunay Triangulations  d维凸包和德洛内三角剖分

 

插图:https://doc.cgal.org/latest/Manual/convex_hull_d-teaser.png

 

作者:Susan Hert, Michael Seel

 

简介:This package provides functions for computing convex hulls and Delaunay triangulations in d-dimensional Euclidean space.

这个包提供了d维欧式空间中凸包的计算和德洛内三角剖分功能。

 

Introduced in 引入版本: CGAL 2.3
BibTeX 文献排版cgal:hs-chdt3-17b
License 版权许可GPL

 

 用户手册英文链接:

https://doc.cgal.org/latest/Convex_hull_d/index.html#Chapter_dD_Convex_Hulls_and_Delaunay_Triangulations

 

API参考手册英文连接:

https://doc.cgal.org/latest/Convex_hull_d/group__PkgConvexHullD.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值