Description: VC和OpenGL实现的点云读取界面，需要的朋友可以下载参考-VC and OpenGL realize the point cloud to read interface, the need for a friend can download the reference Platform: |
Size: 3491840 |
Author:李亮 |
Hits:
Description: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data.
It forms a Delaunay tetrahedralization, then uses a variant of spectral graph partitioning to decide whether each
tetrahedron is inside or outside the original object. The reconstructed surface triangulation is the set of triangular
faces where inside and outside tetrahedra meet. Because the spectral partitioner makes local decisions based on
a global view of the model, it can ignore outliers, patch holes and undersampled regions, and surmount ambiguity
due to measurement errors. Our algorithm can optionally produce a manifold surface. We present empirical
evidence that our implementation is substantially more robust than several closely related surface reconstruction
programs. Platform: |
Size: 7606272 |
Author:madison |
Hits:
Description: 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 Platform: |
Size: 851968 |
Author:tao lu |
Hits:
Description: 基于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. Platform: |
Size: 8103936 |
Author:cl |
Hits:
Description: 描述了空间点云数据三角化的典型算法，基于Delaunay四面体剖分的网格分割算法，对学习点云数据处理有所帮助。-Describes the typical space point cloud data triangulation algorithm, the segmentation algorithm based on Delaunay tetrahedralization of the grid, the study of point cloud data processing helpful. Platform: |
Size: 439296 |
Author:wuenze |
Hits:
Description: 基于凹凸顶点判定的简单多边形Delaunay三角剖分，点云数据处理的学习有所帮助。-Simple polygon based on the concave and convex vertices determine the Delaunay triangulation, the point cloud data processing learning help. Platform: |
Size: 211968 |
Author:wuenze |
Hits:
Description: c#写的程序，主要就是实现delaunay算法，将点云表示成三角网-c# write the program is to achieve delaunay algorithm, represented as point cloud triangulation network Platform: |
Size: 44800000 |
Author:罗毅 |
Hits:
Description: 用delaunay方法实现三维点云数据的重建，此文档是很好的算法，大家可以参考-Delaunay method is used to implement the reconstruction of 3 d point cloud data, this document is a good algorithm, you can reference Platform: |
Size: 82944 |
Author:bing |
Hits:
Description: 已知点云数据采用基于Voronoi算法和Delaunay算法的三角化算法（vc++）。-Known point cloud data based on Voronoi algorithm and the Delaunay triangulation algorithm (Vc++). Platform: |
Size: 3072 |
Author:song |
Hits:
Description: 空间点云数据的各种变换和检选以及二维点云的三角化。其中包括点云数据的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 ball and other algorithms Platform: |
Size: 652288 |
Author:zhch85 |
Hits:
Description: 基于VTk的点云显示，构网（Delaunay Tin，包含二维，三维，及TEN）。附有详细的代码注释，也有实例数据。-(VTk based point cloud display (Delaunay, Tin, including 2D, 3D, and TEN). With detailed code notes, there are examples of data. -) Platform: |
Size: 8102912 |
Author:我们中国
|
Hits:
Description: 用delaunay三角剖分和网格填充对离散点云数据进行网格重建(Mesh reconstruction of discrete point cloud data using Delaunay triangulation and mesh filling) Platform: |
Size: 11264 |
Author:梵高先生1992
|
Hits:
Search - delaunay point cloud