Description: 一个用于三角剖分的类.实用性非常好。对于需要从多边形，点云数据需要剖分的有帮助-triangulation for a class. Practicality is very good. For those from the polygon, point cloud data needs help cutting Platform: |
Size: 141312 |
Author:肖友清 |
Hits:
Description: 用一个兔子模型为例，说明如何实现点云数据的三角划分。结合OpenGL实现模型的旋转操作。-Using a rabbit model as an example to show how to realize the point cloud data triangulation. OpenGL implementation model combining the rotation of the operation. Platform: |
Size: 3450880 |
Author:黄淼 |
Hits:
Description: 本文 研 究 了反求流程中的点云三角化算法及其实现.-In this paper, the reverse flow of point cloud triangulation algorithm and its realization. Platform: |
Size: 2276352 |
Author:张毅 |
Hits:
Description: 实现点云文件的读取与显示，要求点云文件是DAT文件，文件头是点数乘以3，其后是每个点的具体坐标。可以用鼠标进行交互-The realization of point cloud file to read and display requested document is a point cloud DAT files, the first is multiplied by 3 points, followed by the specific coordinates of each point. Can interact with the mouse Platform: |
Size: 4615168 |
Author:YY |
Hits:
Description: this a visual c + + code for point cloud triangulation, i tried it and it works really in a very good way -this is a visual c++ code for point cloud triangulation, i tried it and it works really in a very good way Platform: |
Size: 155648 |
Author:ultrasound |
Hits:
Description: BMyCrust take as input a 3D scatter points cloud and return a tight, manifold, triangulation.
Remember that crust algorithm needs a cloud representing a volume, so open surface may give inaccurate results. For example : a plane can not be triangulated, half-sphere is in doubt, a sphere with a small hole shoud be good.
The more points are given the best the surface will be fitted, of course in this case you would have to wait more and in the worst case a memory help error may occurs. The best results are obtained with more points in high curvature feature.
The old version did not ensure the output surface to be a manifold so it could be used only for graphical purpose. In the new one a tight, regular manifold is returned. It as outward normals orientation, after using this algorithm is very easy to get an STL file from a point cloud.
I added a manifold extraction tool that also correct the errors (slivers) generated by delaunayn during the initial tessellation.-BMyCrust take as input a 3D scatter points cloud and return a tight, manifold, triangulation.
Remember that crust algorithm needs a cloud representing a volume, so open surface may give inaccurate results. For example : a plane can not be triangulated, half-sphere is in doubt, a sphere with a small hole shoud be good.
The more points are given the best the surface will be fitted, of course in this case you would have to wait more and in the worst case a memory help error may occurs. The best results are obtained with more points in high curvature feature.
The old version did not ensure the output surface to be a manifold so it could be used only for graphical purpose. In the new one a tight, regular manifold is returned. It as outward normals orientation, after using this algorithm is very easy to get an STL file from a point cloud.
I added a manifold extraction tool that also correct the errors (slivers) generated by delaunayn during the initial tessellation. Platform: |
Size: 6042624 |
Author:naz |
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: 在VS2008和opencv下，对2D/3D点(云)数据实现三角剖分，运算速度快，实时性好，计算精度高，并对三角剖分进行了优化，可以处理复杂点集的三角剖分，可以用于人脸识别的工作-In the VS2008 and opencv, the pairs of 2D/3D points (cloud) data to achieve triangulation, calculation speed, real-time performance is good, high precision, and triangulation is optimized to handle complex point set triangulation can be used in the work of face recognition Platform: |
Size: 146432 |
Author:三角剖分VC++ |
Hits:
Description: To strike a point cloud of the convex hull has been carried out on the convex hull triangulation, algorithm is simple Platform: |
Size: 30720 |
Author:salwa |
Hits:
Description: 讨论了有关散乱点云的取样及三角网络化模型的实现 并提出了一种高效率的点云提取方法 最后就基于被提取点生成三角网络模型进行了探讨
-Discussed the scattered point cloud sampling and triangulation network and proposed a model to achieve an efficient point cloud extraction method to extract the last point to be generated based on the triangular network model discussed Platform: |
Size: 114688 |
Author:周 |
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: 几篇关于点云三维重建的很好的文章，包含了一些常用的点云三角化的算法，值得学习。-Point cloud reconstruction of several good articles about, including some common point cloud triangulation algorithm, it is worth learning. Platform: |
Size: 18388992 |
Author:rjadmin |
Hits:
Description: 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, and real-time display of the model. Built on the OpenFrameworks framework, the compiler needs to install OpenFrameworks and put it into the myApps directory, but also requires SDK Kinect 1.7 and 2.4.3 OpenCV. Platform: |
Size: 14336 |
Author:a88273 |
Hits:
Description: 3D点云的三角化程序，有多个模型验证三角化程序的有效性-triangulation of point cloud.many models validates the effectiveness of the triangulation. Platform: |
Size: 4855808 |
Author:flywithheart |
Hits:
Description: 用于将点云三角剖分得到三角网格以后，计算重建表面的面积-For the point cloud triangulation, calculate the area of the reconstructed surface
function Platform: |
Size: 5120 |
Author:hamber |
Hits:
Search - point cloud triangulation