搜索资源列表
Symbian_OS_2D_Game_Engine_Example_v1_0
- Symbian OS: 2D Game Engine Example file name: Symbian_OS_2D_Game_Engine_Example_v1_0.zip descr iption: This C++ example application shows how to make a portable and efficient 2D game on top of Symbian OS. The application supports different displ
nso
- 对二维粘性不可压N-S方程求解，生成O型网格-right 2D viscous incompressible Navier-Stokes equations are solved, Generation O Grid
flow3
- 使用f90格式，使用限元法求解二维稳态的不可压缩N-S方程。里面有文件说明用法。-a program which uses the finite element method to solve the steady incompressible Navier Stokes equations in 2D
LUsubs
- N-S方程算法内容，绘制网格，是自己编程用，不用商品软件，2D版-NS equation algorithm content, draw grid, programming their own use, not commercial software, 2D version of
smvp
- N-S方程算法内容，网格读取函数，是自己编程用，不用商品软件，2D版-NS equation algorithm content, grid read function, programming their own use, not commercial software, 2D version of
flow7
- 有限元求解2维n-s方程 The program is executable. To solve a particular problem, you need to include routines that define the shape of the region and the boundary conditions. Problems that are already written up include - finite element method to solve the ste
mirt2D_mexinterp
- interpolates平面图像Z坐标点与X坐标。 Z是假定被定义在定期间隔1点:1:M,N,N][M,地方=大小(Z)。 如果兮,易建联价值观是图像边界,把外面的NaNs在《紫。 Matlab函数是相似的土著 INTERP2字(Z =、烯、彝族、“线性”、南), 但多的主人。如果Z是矢量阵二维图像三维价值),然后反复讨论,interpolates:Z(:1)、Z(,,)、2)::::Z(,,,3),. .等。这部作品对每个图像interpolate速度比独立,例
kdtree_cpp_warpper
- 实现对John Tsiombikas的C语言版的kdtree算法的C++封装，实现了最近邻查询已经指定距离搜索。复杂度NLOG(N),非常快。-A c++ wrapper of John Tsiombikas s library for working with 2d/3d kd-trees
parallel
- 求解二维直角坐标系同位网格上求解稳态N-S方程的并行计算程序,基于PVM信息传递软件，具体信息请看‘readme’文件。-The package contains the codes soving 2D steady Navier-Stokes equations on Cartesian grids with a colocated arrangement of variables using PVM message-passing software, please re
CFD_CSharp
- cfd经典问题C源代码：一维黎曼问题；一维可压N-S方程；二维斜激波刚壁反射；二维泊萧叶黏性流动；有限体积法求解库塔流-Riemann problem a compressible N-S equations of two-dimensional oblique shock wave reflection stiffness 2D Poiseuille viscous flow finite volume method to solve the Kuta flow
CFD_CSharp
- cfd经典问题C源代码：一维黎曼问题；一维可压N-S方程；二维斜激波刚壁反射；二维泊萧叶黏性流动；有限体积法求解库塔流-Riemann problem a compressible N-S equations of two-dimensional oblique shock wave reflection stiffness 2D Poiseuille viscous flow finite volume method to solve the Kuta flow
3-12
- 双调旅行售货员问题 问题分析：给定平面上n个点，p[i]=(x[i],y[i])，I=1,2,3,…,n。点集p1,p2..pi按x坐标排序 t(i)表示点{p1,p2...pi}的最短双调TSP回路，则有， t(i) = min{t(k) + D(k,i) + d(k-1,i) - d(k-1,k)} ，1<k<i t(1) = 0，t(1) = 2d(1,2) d(i,j)为pi,pj之间的距离 D(i,j)为pi,pi+1,pi+1...pj之间累加距离 设s(i