Description: // TetGen computes Delaunay tetrahedralizations, constrained Delaunay tetra- //
// hedralizations, and quality Delaunay tetrahedral meshes. The latter are //
// nicely graded and whose tetrahedra have radius-edge ratio bounded. Such //
// meshes are suitable for finite element and finite volume methods. Platform: |
Size: 254619 |
Author:tangdading |
Hits:
Description: 此程序生成狄洛尼三角网．运用了简单的读取文件．然后依据算法生成三角网．-this program generator Diluoni triangulation. Use a simple read files. Then generation algorithm based on triangulation. Platform: |
Size: 217088 |
Author:杨毅 |
Hits:
Description: // TetGen computes Delaunay tetrahedralizations, constrained Delaunay tetra- //
// hedralizations, and quality Delaunay tetrahedral meshes. The latter are //
// nicely graded and whose tetrahedra have radius-edge ratio bounded. Such //
// meshes are suitable for finite element and finite volume methods. -//TetGen computes Delaunay tetrahedralizations, constrained Delaunay tetra-////hedralizations, and quality Delaunay tetrahedral meshes. The latter are//// nicely graded and whose tetrahedra have radius-edge ratio bounded. Such//// meshes are suitable for finite element and finite volume methods. Platform: |
Size: 253952 |
Author:tangdading |
Hits:
Description: 带岛区约束数据域的Delaunay三角剖分通用算法研究(文章)，有参考价值-Band Island constrained domain of generic algorithm for Delaunay triangulation (articles), there is reference value Platform: |
Size: 348160 |
Author:zero |
Hits:
Description: 实现点集的约束Delaunay三角剖分，采用GUI图形设计界面-Constrained Delaunay triangulation point set using the GUI graphical design interface Platform: |
Size: 3533824 |
Author:严红娟 |
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: 一个新的合并方法，多重网格（在一个共同的坐标）在一个单一的拓扑正确的网。这种方法是基于约束Delaunay四面体化和图割优化-a new merging method of multiple meshes (in a common coordinate) into one single topologically correct mesh. This method is based on the constrained Delaunay tetrahedralization and graph cuts optimization Platform: |
Size: 1666048 |
Author:陈 |
Hits:
Description: 是一款用于三维模型网格三角化剖分的工具。(TetGen is a program to generate tetrahedral meshes of any 3D polyhedral domains. TetGen generates exact constrained Delaunay tetrahedralizations, boundary conforming Delaunay meshes, and Voronoi partitions. The following pictures respectively illustrate a 3D polyhedral domain (left), a boundary conforming Delaunay tetrahedral mesh (middle), and its dual - a Voronoi partition (right).) Platform: |
Size: 234496 |
Author:airdamper |
Hits:
Search - constrained Delaunay