Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - 3D convex hull

Search list

[Other resource] chull

Description: Computational Geometry in C 书中的源代码 生成三维凸包-Computational Geometry book in the C source code generated 3D convex hull
Platform: | Size: 8970 | Author: wuxsren | Hits:

[Graph program] chull

Description: 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, in postscript with embedded comments showing the vertices and faces. Compile: gcc -o chull chull.c (or simply: make)
Platform: | Size: 9915 | Author: fds | Hits:

[Graph Recognize] 2D

Description: 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(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Platform: | Size: 67880 | Author: Mark | Hits:

[Graph Recognize] 2D

Description: 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(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm-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(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Platform: | Size: 67584 | Author: Mark | Hits:

[OpenGL program] ConvexHall

Description: ConvexHall实现 3D Convex Hall implementation: Given N points in the space, the algorithm display the construction of the convex hall.-ConvexHall Convex 3D Hall implementati on : Given N points in the space, the algorithm display the construction of the c onvex hall.
Platform: | Size: 47104 | Author: 李萍 | Hits:

[source in ebook] chull

Description: Computational Geometry in C 书中的源代码 生成三维凸包-Computational Geometry book in the C source code generated 3D convex hull
Platform: | Size: 8192 | Author: industry pho | Hits:

[GIS program] Voronoi

Description: 自己用VC编写的GIS中voronoi图和凸壳自动生成源代码-Their use of VC in the preparation of GIS maps and Convex Hull voronoi automatically generated source code
Platform: | Size: 2169856 | Author: 刘晓静 | Hits:

[ActiveX/DCOM/ATL] computationgeometry

Description: 我的计算几何模板，求3d凸包，计算最远点对（nlogn），求最近点对，和二维凸包-Computational geometry to my template, and 3d convex hull calculation of farthest point of (nlogn), for nearest point right, and two-dimensional convex hull
Platform: | Size: 6144 | Author: bill | Hits:

[Graph program] chull

Description: 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, in postscript with embedded comments showing the vertices and faces. Compile: gcc -o chull chull.c (or simply: make)-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, in postscript with embedded comments showing the vertices and faces. Compile: gcc-o chull chull.c (or simply: make)
Platform: | Size: 9216 | Author: fds | Hits:

[Special Effects] Ccode2.tar

Description: 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 Hull[2D] Chapter 3, Code 3.8 /graham Convex Hull[3D] Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Platform: | Size: 57344 | Author: XJ | Hits:

[Other] chull_3dConvexHull

Description: 求空间点集的三维凸包。chull.cpp, chull.h。来自计算几何英文原著作者个人网站。-computer 3D convex hull of a set of points. The set of points are not on a same plane.
Platform: | Size: 5120 | Author: liuctic | Hits:

[3D Graphic] convex-hull

Description: This code computes the 3D convex hull of a points set.
Platform: | Size: 6144 | Author: Vicki | Hits:

[JSP/Java] src

Description: Another convex hull algoritm for 3d points in java
Platform: | Size: 17408 | Author: Kivu | Hits:

[VC/MFC] qhull-2010.1

Description: 快速凸包的算法。网站上下来的。http://www.qhull.org -Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions.
Platform: | Size: 2236416 | Author: lilinx | Hits:

[3D Graphic] Delaunay3D

Description: 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 points from a XML PolyData file (.vtp) produces the 3D Delaunay tetrahedralization (both with alpha = 0 and a non-zero alpha), and displays the result on the screen.
Platform: | Size: 2048 | Author: 于振国 | Hits:

[Data structs] 3D-Convex-Hall_struct

Description: 构建三维凸包 给出很多的点坐标，然后根据算法要求构建凸包-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
Platform: | Size: 391168 | Author: 徐云朋 | Hits:

CodeBus www.codebus.net