搜索资源列表
chull
- Computational Geometry in C 书中的源代码 生成三维凸包-Computational Geometry book in the C source code generated 3D convex hull
chull
- This code is described in \"Computational Geometry in C\" (Second Edition), Chapter 4. It is not written to be comprehensible without the explanation in that book. Input: 3n integer coordinates for the points. Output: the 3D convex hull,
2D
- C code for \"Computational Geometry in C (Second Edition)\": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(
convex-hull.rar
- This code computes the 3D convex hull of a points set.,This code computes the 3D convex hull of a points set.
Ccode2.tar
- c语言计算几何 三角化 Ch1, Code 1.14 凸形外壳[2D] Ch3, Code 3.8 凸形外壳[3D] Ch4, Code 4.8 球 Chapter 4, Fig. 4.15 德劳内类型 Ch5, Code 5.2 ...See *English version.-\Computational Geometry in C\ the book s recipe Triangulate Chapter 1, Code 1.14 /tri Convex
chull_3dConvexHull
- 求空间点集的三维凸包。chull.cpp, chull.h。来自计算几何英文原著作者个人网站。-computer 3D convex hull of a set of points. The set of points are not on a same plane.
Delaunay3D
- VTK delaunay3D 实例 ,VTK库中的delaunay3D 来进行点云的三角化。-This example creates a tetrahedral mesh from unorganized points. The example uses the vtkDelaunay3D filter. The resulting mesh will be a solid convex hull of the original points. The example takes the po
3D-Convex-Hall_struct
- 构建三维凸包 给出很多的点坐标，然后根据算法要求构建凸包-Construction of three-dimensional convex hull We give a lot of point coordinates, and then build the convex hull algorithm according to the requirements of