搜索资源列表
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
triangulation_
- trangulation 双目视觉中的三角化定位-trangulation binocular vision in the triangulation positioning
world2camera1
- 输入3维点云，给定相机内外参数，输入纹理源图像，本程序能自动进行点云三角化并生成对应的纹理序列以及纹理坐标，输出数据可以便于opengl处理-input point-cloud,parameters of camera texture source image ,output texture series and texture coordinates which is convenient for OpenGL
triangulationalgorithms
- 基于MATLAB对两种三角化算法的分析 基于MATLAB对两种三角化算法的分析-MATLAB based on the analysis of two kinds of triangulation algorithmsMATLAB based on the analysis of two kinds of triangulation algorithms
normal-triangulation
- 构建三角化网格，并画出每个三角面的法向量的方法-Building triangulation and draw the normal vector of each triangle
harris_gray1
- harris角点检测 delaunay三角化-harris corner detection delaunay triangulation
Triangle
- 用matlab写的，在一堆网格点上进行三角化，mycrust为主程序-Using matlab written on a pile of grid points to triangulate
greedy_projection
- 利用PCL对点云进行三角化，贪婪算法，输入为PCD文件输出为VTK文件-Fast triangulation of unordered point clouds
sanjiaohua-
- PCL点云，无序点云三角化，结合VS2010平台-PCL point cloud, disorderly point cloud triangulation, with VS2010 platform
Delaunay
- 德劳内三角化 算法,通过该算法可以对平面进行三角化分割-Thriangle divided
DELAUNEY
- 利用DELAUNEY三角化方法生成非结构三角网格，可用于有限元或有限体积法网格的自动划分-Triangulation method using DELAUNEY generate unstructured triangular meshes, can be used for finite element or finite volume Mesh automatic classification
qhull-2015.2
- 最新版的qhull 用于快速实现三维凸包,并且有Delaunay三角化，半平面交，voronoi图。programs.-a 3D quickhull program，and has delaunay triagulation,half intersection,voronoi
dianyunsanjiaohua
- 点云三角化 Delaunay三角剖分 构造曲面-Point Cloud triangulation Delaunay triangulation Construction surfaces
triangulation_svg
- MATLAB点云处理程序，将点云进行三角化-TRIANGULATION_SVG plots a triangulated set of nodes.
Crust_algorithm
- 用于Crust图的散乱数据点集的曲面网格重建的算法，包括Voronoi图和Delaunay三角化的全新的曲面重建算法。-Algorithm for scattered data points Crust graph of surface mesh reconstruction, including the Voronoi diagram and Delaunay triangulation algorithm.
threemesh
- 已知点云数据采用基于Voronoi算法和Delaunay算法的三角化算法（vc++）。-Known point cloud data based on Voronoi algorithm and the Delaunay triangulation algorithm (Vc++).
Triangle_Selection
- 基于Opengl实现的，人脸三角化，并可通过鼠标点选三角片-Based on the implementation of Opengl, human face triangulation, and can be selected through the mouse click
SimpleReconstruction
- Kinect和OpenCV实现简单的点云三角化，用最小二乘法计算法线，并实时显示获得的模型。建立在OpenFrameworks框架上，编译需要安装OpenFrameworks并放到myApps目录里，还需要Kinect SDK 1.7和OpenCV 2.4.3。-Kinect and OpenCV to achieve a simple point cloud triangulation, using the least square method to calculate the normal
3
- 空间点云数据的各种变换和检选以及二维点云的三角化。其中包括点云数据的Delaunay三角化,鼠标检选，跟踪球等算法-Various transformation and detection of spatial point cloud data and triangulation of 2D point cloud. Including the Delaunay triangulation of point cloud data, the mouse detection, tracking ba
BlogAlgCp
- 一种实现轮廓线重构的简易方法，其关键的步骤体现在相邻轮廓线的编织方法以及顶底层轮廓线的三角化上。并且用c++代码来实现之。-A simple method to realize contour reconstruction is the key step of the method, which is embodied in the knitting method of the adjacent contour line and the triangulation of the top bott