本帖最后由 虎哥 于 2021-12-17 14:00 编辑
| 插件名称：Geometry Algorithms 2.3.3 | 插件官网：访问官网 | | 版权协议：Red pine1.1 | 解压密码：通用密码 |
Geometry Algorithms 2.3.3
Geometry Algorithms 2.3.3
几何学算法
Geometry Algorithms 2.3.3
Geometry Algorithms
Geometry Algorithms is a collection of algorithms that will help you to generate or improve complex geometry from any data set几何学算法是一个算法集合，将帮助你从任何数据集中生成或改进复杂的几何学
Triangulation - This algorithm creates ready-to-use Unity meshes or raw geometry from any set of points. Constrained Delaunay triangulations are supported for 2D and 2.5D (e.g. terrain) datasets, so you can add boundaries and holes to generate more complex geometry. Triangulations in 3D space are possible as well, but only for convex shapes.
Hull algorithms - Find the boundary of any point dataset, that can be used for visualization purposes or for further calculations (e.g. use the boundary to create constrained triangulations). Both convex and concave hulls can be generated for 2D and 2.5D datasets. In 3D, it is limited to convex hulls.
|
|
