Trimpack is a library of routines written in Fortran that allow to create unstructured triangular meshes in any domain and with an user-defined size distribution. The user must write a program that uses the elements of the library as if it were a mathematical tool. First, the domain must be defined, using point-defined boundaries, which the user provides. The library internally uses splines to mesh the boundaries with the node distribution function provided by the user. Several meshing methods are available, from simple Dalaunay mesh creation from a point cloud, an incremental Steiner-type algorithm that also generates Dalaunay meshes to an efficient advancing-front type algorithm. This report carries out a bibliographic review of the state of the art in mesh generation corresponding to the period in which Trimpack was written for the first time, which is a very fruitful period in the development of this type of algorithms. Next, MeshGen is described in detail, which is a program written in C ++ that exploits the possibilities of the Trimpack library for the generation of unstructured triangular meshes and that has a powerful graphical interface. Finally, it also explains in detail the content of the Trimpack library that is available under GNU Public license for anyone who wants to use or improve it.
翻译:Trimpack 是一个用 Fortran 撰写的常规库库, 它允许在任何域内创建不结构的三角间距, 并使用用户定义的大小分布 。 用户必须写一个程序, 将图书馆的元素使用为数学工具。 首先, 域必须使用用户提供的点定义界限来定义 。 图书馆内部使用 Sextline 来将用户提供的节点分布函数的边界混在一起。 有几种网格方法可供使用, 从简单的 Dalaunay 网格创建点云, 一种递增的 Steiner 型算法, 也生成 Dalaunay Meshes, 到 高效的先行型算法 。 此报告对网格一代的艺术状态进行书目审查, 与Trimpack 首次写入时的时期相对应, 这是开发这种算法的非常有成效的时期 。 其次, MeshGen 详细描述一个C++ 程序, 利用Trimack 库库的可能性来生成不结构三角间断的三角间线, 并有强大的 Gnproom 格式。 最后解释它是如何使用。