Search - plane points

Search - plane points - List

[Algorithm] 8node DL : 0: 平面8节点单元类，可以输出单元的刚度、质量、阻尼矩阵，并可通过形函数插值得到内部各点得位移、应力等。对各位以前编写的程序的一个补充和完善吧。-plane eight-unit category, the output unit stiffness, mass, damping matrix, through the shape function can be interpolation points in the internal displacement and stress. Right before you and the procedure for the preparation of a supplement and perfect it.
Date : 2025-12-29 Size : 4kb User : stefanie
[Algorithm] dongtaiguihua DL : 0: 设平面上有一个m´ n的网格，将左下角的网格点标记为（0,0）而右上角的网格点标记为（m,n）。某人想从（0,0）出发沿网格线行进到达（m,n），但是在网格点（i,j）处他只能向上行进或者向右行进，向上行进的代价为aij（amj ＝＋¥ ），向右行进的代价是bij（bin ＝＋¥ ）。试设计一个动态规划算法，在这个网格中为该旅行者寻找一条代价最小的旅行路线。用高级程序设计语言编写程序求解动态规划模型。-Set up a plane m n of the grid, will be the lower-left corner of the grid points marked as (0,0) and the upper right corner of the grid point marked as (m, n). A person from (0,0) along the starting grid to reach the road (m, n), but the grid point (i, j) Department only him right up the road or the road, up the road price for the aij ( amj = ￥), the road to the right price is bij (bin = ￥). Try to design a dynamic programming algorithm, in this grid for travelers to find a minimum cost of travel routes. Advanced programming language used to write programs to solve dynamic programming model.
Date : 2025-12-29 Size : 1kb User : 陆嘉鸣
[Algorithm] heibaidian DL : 0: 设平面上分布着n个白点和n个黑点，每个点用一对坐标（x, y）表示。一个黑点b=（xb,yb）支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw。若黑点b支配白点w，则黑点b和白点w可匹配（可形成一个匹配对）。在一个黑点最多只能与一个白点匹配，一个白点最多只能与一个黑点匹配的前提下，求n个白点和n个黑点的最大匹配对数。-Plane based distributed white n black point and n points, each point with a pair of coordinates (x, y) express. A black point b = (xb, yb) domination of a white point w = (xw, yw) if and only if xb
Date : 2025-12-29 Size : 237kb User : kineapple
[Algorithm] CLOSESTPAIR DL : 0: 使用分治算法找到平面上的n各点的集合S中最小距离的一个点对-Use Divide and Conquer Algorithm to find the plane of the set of n points S in the minimum distance of a point on the
Date : 2025-12-29 Size : 359kb User : 钟峰
[Algorithm] MC_3points DL : 0: 蒙特卡罗启发式搜索算法，在平面内的多个点找到任意三点组成对大三角形的面积-Monte Carlo heuristic search algorithm, a number of points in the plane to find any of three large triangular area formed
Date : 2025-12-29 Size : 3kb User : zhaochuanmin
[Algorithm] MIN_CURVE_SURF DL : 0: 最小曲率法的算法原理,以及算法例子. 有配图说明最小曲率法是定向井、水平井轨道设计、测斜计算中经常使用的一种方法。在最小曲率法中，假设井段是空间斜平面上圆弧；对于滑动钻进方式，圆弧是非常合理的井眼轨迹曲线。-The MIN_CURVE_SURF function interpolates a regularly- or irregularly-gridded set of points, over either a plane or a sphere, with either a minimum curvature surface or a thin-plate-spline surface.
Date : 2025-12-29 Size : 21kb User : 李波
[Algorithm] cpair DL : 0: 用分治法求平面两点的最短距离，main函数用随机数生成n个随机数，然后求他们的最短距离-Plane with the Method of the shortest distance between two points, main function uses the random number generator random number n, and then find the shortest distance between them
Date : 2025-12-29 Size : 309kb User : 凌川
[Algorithm] shiyan3 DL : 0: 设p1=(x1, y1), p2=(x2, y2), …, pn=(xn, yn)是平面上n个点构成的集合S，设计算法找出集合S中距离最近的点对。-Let p1 = (x1, y1), p2 = (x2, y2), ..., pn = (xn, yn) is the plane the set of n points S, S in the design algorithm to find the nearest collection point right.
Date : 2025-12-29 Size : 891kb User : zhong
[Algorithm] MulPointPlane DL : 0: 多点平面度拟合程序，可以对任意数量的点进行平面拟合-Flatness more fitting procedure can be any number of points on the plane fitting
Date : 2025-12-29 Size : 1.12mb User : 飞哥
[Algorithm] meshbiliner DL : 0: 二维热传导方程，质量矩阵刚度矩阵的生成以及网格刨分-Two-dimensional heat conduction equation, the mass matrix stiffness matrix generation and grid plane points
Date : 2025-12-29 Size : 1kb User : 王振宇
[Algorithm] StokesHotine DL : 0: 地球科学：重力场积分(Fortran90) Stokes/Hotine/V_M垂线偏差积分：数值积分、二维平面FFT、二维球面FFT、一维FFT-Earth Sciences: Gravity Field Points (Fortran90) Stokes/Hotine/V_M deflection of the vertical integration: numerical integration, the two-dimensional plane FFT-dimensional sphere FFT, one-dimensional FFT
Date : 2025-12-29 Size : 4kb User : Zhang Chuanyin
[Algorithm] geompack3 DL : 0: 基于三角形网格的网格生成方法，用于网格生成的fortran90程序，非常好用。-GEOMPACK3 is a set of routines for certain computational geometry problems. In particular, it can compute the Voronoi diagram, and the Delaunay triangulation, of a set of points in the plane.
Date : 2025-12-29 Size : 1kb User : Jason
[Algorithm] using-four-points-to-fitting-a-plane DL : 0: 四点拟合一个平面，并且判断其他点到面的距离以及方向-Using four points to fit a plane, and tell you the distance and direction from other points to the plane.
Date : 2025-12-29 Size : 7.03mb User : liujie
[Algorithm] x DL : 0: ★问题描述: 给出平面上的N 个二维点，求出距离最小的2 个点对。本题中距离定义为他们的直线距离。例如(0,0) (3,4)的距离为5. ★数据输入：有多组数据，对于每组数据，第一行是一个数字N 表示点的个数。N=0 的时候说明输入结束。之后N 行，每行有2 个浮点数x_i,y_i 表示第i 个点的坐标。(1<=N<=10000 0,0<=|x_i|,|y_i|<=10^9) ★结果输出: 输出一个浮点数，表示最近点对的距离除以2，保留2 位小数(四舍五入)。-★ Problem Description: Gives the N-dimensional point in the plane, find the minimum distance two points right. The problem is defined as the distance of their straight Line distance. E.g., (0,0) (3,4) distance is 5. ★ Data input: Multiple sets of data, for each set of data, the first line is a number N represents the number of points. Description when N = 0 Enter the ending. After N lines, each line has two floating-point numbers x_i, y_i represents the i-th coordinate point. (1 <= N <= 10000 0,0 <= | x_i |, | y_i | <= 10 ^ 9) ★ resulting output: Output a float that is the nearest point on the distance divided by 2, to retain two decimal places (rounded).
Date : 2025-12-29 Size : 1kb User : 徐冬胜
[Algorithm] Curve_fitting DL : 0: 对平面上给定的多点进行多项式曲线的拟合，可设置拟合多项式的次数-Given more points on the plane polynomial curve fitting, you can set the number of polynomial fitting
Date : 2025-12-29 Size : 1kb User :
[Algorithm] snajiaoxing DL : 0: 在平面直角坐标系上任意输入三个点，判断这三点能否构成一个三角形-Cartesian coordinate system in the plane any input three points, three points can determine which form a triangle
Date : 2025-12-29 Size : 131kb User : 小明
[Algorithm] FemTriangle DL : 0: 2维三角网格刨分，进行有限元计算的前处理工具，可以根据不同的边界及区域产生自适应大小的网格。-Two-dimensional plane triangulation points, pre-processing tools FEM can produce adaptive mesh size depending on the boundary and region.
Date : 2025-12-29 Size : 1.17mb User : haungyzh
[Algorithm] multi_iter_average DL : 0: 多次迭代滑动平均算法，是选一矩形窗口，在平面上逐点滑动，计算窗口内所有点的平均值及观测值与此平均值之差-Multiple iterative moving average algorithm is to a rectangular window, sliding on the plane point by point, calculate the average value of all the points in the window and the difference between the observed and the average
Date : 2025-12-29 Size : 1kb User : LU
[Algorithm] 拉格朗日插值+MATLAB源程序代码 DL : 1: 拉格朗日插值法可以找到一个多项式，其恰好在各个观测的点取到观测到的值。数学上来说，拉格朗日插值法可以给出一个恰好穿过二维平面上若干个已知点的多项式函数。(The Lagrange interpolation method can find a polynomial that happens to be taken to the observed value at the point of each observation. Mathematically, the Lagrange interpolation method can give a polynomial function that happens to pass through a number of known points on the two-dimensional plane.)
Date : 2025-12-29 Size : 60kb User : g-nice