Search - 3d delaunay

Search - 3d delaunay - List

[Graph Recognize] 2D DL : 0: 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
Update : 2025-02-19 Size : 66kb Publisher : Mark
[Fractal program] fenxing DL : 0: 分形算法C++程序：内含三维空间中的分形插值算法源代码-fractal algorithm C : 3D space containing the fractal interpolation algorithm source code
Update : 2025-02-19 Size : 109kb Publisher : 齐松
[3D Graphic] cdtall.tar DL : 0: Constraint Delaunay triangulations,用于剖分具有外部轮廓线或内部轮廓线的离散点集 -Constraint Delaunay triangulations, uses in to cut in half has exterior contour line or the internal contour line separate set of points
Update : 2025-02-19 Size : 690kb Publisher : 洋流
[OpenGL program] Delaunay-Trianglation-Mesh-Generation DL : 0: 这也是一个delaunay三角网的程序，功能是我见到最强大的。能生成二维和三维，并有openGl创建模拟三维图。原程序中编译时需要wx/的文件，我没有找到。不过不影响程序的学习.希望对你有用！！包中有.exe可先-This is a triangular network nodes procedures, I see the function is the most powerful. Can generate two-dimensional and three-dimensional, and openGl create simulated three-dimensional map. The original procedure required compiler wx/documents, I could not find. But not affect the learning process. Hope useful to you! ! Included in the package. Exe can take a look at!
Update : 2025-02-19 Size : 47kb Publisher : gaoqing
[GDI-Bitmap] delanay_all DL : 0: 这时一个delaunay三角网的程序，功能强大，并里面有详细说明和程序及原代码。能创建二维和三维的，且能生成模拟的3D图。-then a triangular network nodes procedures, powerful, and there are detailed procedures and the original code. To be able to create two-dimensional and three-dimensional and can generate simulated 3D map.
Update : 2025-02-19 Size : 1.85mb Publisher : gaoqing
[Special Effects] Ccode2.tar DL : 0: 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
Update : 2025-02-19 Size : 56kb Publisher : XJ
[GDI-Bitmap] triTIN DL : 0: 程序生成TIN三角形，根据2D或者3D的离散点生成，分析-This program generates Triangulated Irregular Network, or TIN from scattered points on two-dimensional plane based on Delaunay s triangulation. This data structure allows data to be displayed as three-dimensional surface, or to be used for terrain analysis including contouring and visibility mapping.
Update : 2025-02-19 Size : 47kb Publisher : Libz
[3D Graphic] 3d DL : 0: 此资料介绍的是：利用OpenGL实现三维地形可视化,采用Delaunay三角化法得到地形采样点,并用已知数据对三角曲面进行插值加密,生成规则格网(GRID)数据结构的方法,可得到高度真实感的三维地形可视化效果。 -The data presented are: the use of OpenGL for three-dimensional terrain visualization, using Delaunay triangulation method to be terrain sampling point, and with the known data encryption on the triangular surface is interpolated to generate the rules Grid (GRID) data structure method can be obtained highly realistic 3D terrain visualization.
Update : 2025-02-19 Size : 80kb Publisher : 周倩倩
[3D Graphic] Caylus_map_3D.m DL : 0: Generation of 3D MAP with Delaunay
Update : 2025-02-19 Size : 2kb Publisher : Sylvain
[3D Graphic] Delaunay DL : 0: Delaunay 分治算法三角网格剖分！-Source code for DeWall, a divide and conquer 3d Delaunay
Update : 2025-02-19 Size : 576kb Publisher : 竹林英客
[Software Engineering] 3d-reconstruction DL : 0: Update : 2025-02-19 Size : 1.14mb Publisher : zhangbaobao
[VC/MFC] qhull-2010.1 DL : 0: 快速凸包的算法。网站上下来的。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.
Update : 2025-02-19 Size : 2.13mb Publisher : lilinx
[matlab] BallFretting190809 DL : 0: This tool is a simplification of the ballpivoting algorithm. It imagines a bella eating a delaunay traignulation in order to extract a manifold surface. It requires a single parameter: radius of the fretting ball. Ball Fretting Given a uniform sampled filled point cloud returns a tight triangulation. Input: ■tetr: a set of tetraedrons, nx4 array. If the cloud is not tesselated yet you need to call a delaunay triangulator prior calling this function. ■p : nx3 array, 3D set of points. ■r : the only parameter of the algorithm, the radius of the fretting ball Output: ■t : triangles ids, nx3 array ■tnorm: normals of triangles with outwards orientation
Update : 2025-02-19 Size : 832kb Publisher : tao lu
[3D Graphic] winPointCloud DL : 0: 基于VTk的点云显示，构网（Delaunay Tin，包含二维，三维，及TEN）。附有详细的代码注释，也有实例数据。-The point cloud based VTk display, configuration network (Delaunay Tin, including 2D, 3D, and TEN). With detailed code comments, but also instance data.
Update : 2025-02-19 Size : 7.73mb Publisher : cl
[3D Graphic] PlantraEN1608 DL : 0: Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines
Update : 2025-02-19 Size : 6.18mb Publisher : superlzhi
[3D Graphic] Delaunay DL : 0: delaunay三角化实现三角网格剖分，并能够实现3D显示-delaunay triangulation triangular mesh, and 3D display
Update : 2025-02-19 Size : 2.74mb Publisher : leon
[GDI-Bitmap] vtk2DDelaunayGeneration DL : 0: C++结合VTK三维可视化库，实现2D和3D Delaunay网格生成的代码，是学习vtk管线编程和 Delaunay 三角网格生成的很好的程序代码-2D & 3D Delaunay Mesh Generation implemented by c++ & vtk
Update : 2025-02-19 Size : 1.15mb Publisher : lixiang
[3D Graphic] Triangulation_3 DL : 0: 可以做三维的三角剖分，速度快，效率非常非常高。-is used for 3D Delaunay triangulation
Update : 2025-02-19 Size : 9.2mb Publisher : yjh
[3D Graphic] Delaunay3D DL : 0: 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.
Update : 2025-02-19 Size : 2kb Publisher : 于振国
[VC/MFC] Delaunay-Triagulation DL : 0: 空间散乱点三角剖分的设计与实现程序，算法得到了优化，速度很快。-delaunay 3d c++
Update : 2025-02-19 Size : 4.39mb Publisher : lichwjob

« 12 »