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:
Description: 主要研究离散点的Delaunay三角网生成算法、基于三角网等值线生成算法以及等值线区域填充-Main research Delaunay triangular mesh generation algorithm of discrete points isoline, based on triangular mesh generation algorithm and contour area filling
Platform: |
Size: 220160 |
Author:cumtchenye |
Hits:
Description: CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和三维的点，2D加权Voronoi图，分割Voronoi图等），多边形（布尔操作，偏置），多面体（布尔运算），曲线整理及其应用，网格生成（二维Delaunay网格生成和三维表面和体积网格生成等），几何处理（表面网格简化，细分和参数化等），凸壳算法（2D，3D和dD），搜索结构（近邻搜索，kd树等），插值，形状分析，拟合，距离等。-The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page.
The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations, and Delaunay triangulations and periodic triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Del Platform: |
Size: 18593792 |
Author:a |
Hits:
Description: 用于Crust图的散乱数据点集的曲面网格重建的算法，包括Voronoi图和Delaunay三角化的全新的曲面重建算法。-Algorithm for scattered data points Crust graph of surface mesh reconstruction, including the Voronoi diagram and Delaunay triangulation algorithm. Platform: |
Size: 1172480 |
Author:song |
Hits:
Description: TRIANGULATION_REFINE is a MATLAB program which reads information describing a triangulation of a set of points and creates a refined triangulation.
The refined triangulation is created by dividing each triangle into four similar subtriangles. The mesh size parameter h will be halved by such a procedure. If the input triangulation is Delaunay, then so will be the output triangulation.
The program can handle triangulations that use 3 or 6 nodes per triangle. Platform: |
Size: 9216 |
Author:Yu Deyang |
Hits:
Description: 用于Crust图的散乱数据点集的曲面网格重建的算法,包括Voronoi图和Delaunay三角化的全新的曲面重建算法crust算法(The algorithm of surface mesh reconstruction for scattered data points set of Crust diagram, including Voronoi and Delaunay triangulation, a new algorithm of surface reconstruction, crust algorithm.) Platform: |
Size: 3072 |
Author:ajfeef |
Hits:
Search - delaunay mesh of points