搜索资源列表
20104226553336
- 1.加入控制器(在文件UPhysics2DControllers中),可实现浮力、风力、万有引力场、爆炸、阻尼等效果。其中的风力与爆炸效果是原C++版本中所没有的。大家还有什么新奇的想法可以联系我,为box2D Delphi加入更多的控制器,实现更多的物理效果。 2.添加了单元UPhysics2DPolygonTool,实现任意多边形的细分化(三角化)。可使box2D支持任意边数的多边形和凹多边形物体。目前这部分的demo还未完成,一位外国朋友正在制作。-1. Join the contr
triangle
- 对于给定的初始点集P,有多种三角网剖分方式,其中Delaunay三角网具有以下特征: 1、Delaunay三角网是唯一的; 2、三角网的外边界构成了点集P的凸多边形“外壳”; 3、没有任何点在三角形的外接圆内部,反之,如果一个三角网满足此条件,那么它就是Delaunay三角网。 4、如果将三角网中的每个三角形的最小角进行升序排列,则Delaunay三角网的排列得到的数值最大,从这个意义上讲,Delaunay三角网是“最接近于规则化的“的三角网。-For given
ParallelLine
- 最近一直处理多边形相关的处理,包括自相交图形分割,有洞多边形的分割,任意不相交多边形的三角分割,其中用到了折线平行线的生成算法,见附件。提高了图形的描画速度。以后会继续上传多边形处理的论文和处理代码。-Have recently been dealing with polygon-related processing, including the self-intersection graph partition, there are holes polygons partition, arbi
TriangBasisPolygonMorph
- 基于三角基的平面多边形变形 调试环境:Win XP;VC++ 6.0 -Based on the triangle-based planar polygon deformation debug environment: Win XP VC++ 6.0
TrianglePro
- 输入n个点 判断是否能形成凸多边形 并给出三角划分-Enter the n points to determine whether to form a convex polygon and give triangulation
triangulation.tar
- 为面绘制中的多边形的三角化程序,对于面得增加或者减少进行了比较详尽的讲解-For the surface rendering of polygons in a triangular-based program, for the surface may increase or decrease were compared with detailed explanations
triangulation
- 动态规划实现对多边形的三角剖分,顺时针定义各个顶点值实现最优剖分。-Dynamic program to achieve triangulation of the polygon.Clockwise to definit the value of each vertex achieve the optimal split.
Voronoi
- 先对散点进行三角网生成,然后再有三角网生成Voronoi多边形。还可以在生成的Voronoi图中继续追加散点,进一步生成新的Voronoi图。程序在Vc++2003环境下编译通过。-Get TIN through some points.Then derive Voronoi graph from TIN.After you get your first Voronoi graph,you can continue add new points to form new Voronoi graph
TIN_Voronoi
- Delualy 三角网 同时生成Vionoi多边形-Delualy also generate Vionoi polygon triangulation
Triangulardecomposition
- 任意多边形的三角凸分解的C语言程序源代码-Triangle Convex Polygon Decomposition of C language source code
triangulation.tar
- 对于不带洞多边形的三角剖分算法,速度比较快,但是不是最优剖分-fast triangulation method,but not perfect,maybe strange triangles!very long triangle!
convex-polygon-triangulation
- 给定一系列坐标定点,先判定能否构成凸多边形,然后进行最优三角剖分-Given a series of fixed-point coordinates, first determine whether the composition of convex polygons, then the optimal triangulation
vtkImplicitPolyDataBeta2-0001
- vtk多边形布尔运算源码,处理效果很棒,但对100000个以上的三角面片处理比较慢-vtk polygonal Boolean operations source code, the operation result is great, but for more than 100,000 triangles it is a little slower
333
- 求凸多边形最优三角剖分。用动态规划问题有效解决该问题。多边形是平面上一条分段线形封闭曲线。-Optimal convex polygon triangulation. Dynamic programming problem with an effective solution to the problem. Sub-polygon is a plane closed curve linear.
programme
- 将不带洞的任意多边形进行三角分割源得到分割后三角形的顶点代码-Will not be any polygon with a hole triangular split the source to be split after the vertices of the triangle code
12
- 很好的三角剖分程序,尤其是针对多边形的三角剖分。-Good triangulation procedures, especially for polygon triangulation.
CPolygon
- 定义了平面多边形类。 其中包括了多边形的很多方法:中心三角化,迪落尼三角化,判断对角线是否在多边形内,等。-Define a plane polygon class Including many polygon method: whether the center triangulation, Di off the Niger Delta, judgment diagonal within the polygon, etc..
MemDraw_V1.0.0.10
- 内存画图DLL,可以快速画出圆,矩形,三角,多边形等常见的图形以及各种曲线-Memory drawing DLL, can quickly draw circle, rectangle, triangle, polygon, such as graphics and a variety of common curve
Delaunay_WinForm
- 根据点生成狄洛尼三角网,以进一步生成泰森多边形-To generate Thiessen polygons based on points generated Di Luoni Triangle
FIST
- 一种根据多边形进行三角网格剖分的算法,简称FIST.希望对相关网友有所帮助。-A method according to polygon mesh triangulation algorithm, referred to FIST. Want to be helpful to the relevant users.