Location:
Search - chord p
Search list
Description: 累加弦长三次参数样条曲线-cumulative chord three parameters spline curve
Platform: |
Size: 2041 |
Author: 程雷 |
Hits:
Description: 累加弦长三次参数样条曲线-cumulative chord three parameters spline curve
Platform: |
Size: 2048 |
Author: 程雷 |
Hits:
Description: p2p结构化经典算法，用C语言实现，应用于分布式存储，流媒体点播等多种途径-p2p structured classical algorithm, using C language, used in distributed storage, on-demand streaming media, such as a variety of ways
Platform: |
Size: 82944 |
Author: liufendou |
Hits:
Description: 包括部分空间算法，如计算两坐标点距离、判断两坐标点是否相等、计算叉积、计算点积、判断点p是否在线段l上、计算点bp以点op为圆心逆时针旋转dAlpha(单位：弧度)后所在的坐标点位置、计算指定半径圆上指定角度的弦长、计算由起点坐标和终点坐标构成的线段在指定距离和指定方向的垂点坐标等空间算法-Including some space algorithms, such as calculating the distance between the two coordinates to determine whether the same two coordinates to calculate cross product, point multiplication calculation to determine whether point p on line l above the calculation point to point op for bp counterclockwise rotation center dAlpha (units : radian) after the location where the coordinates of points, calculated on the specified radius of a round angle specified chord length, calculated from the starting point coordinates and end coordinates of the line constitutes a specified distance and specified direction of the vertical space coordinate algorithm
Platform: |
Size: 7168 |
Author: yujian |
Hits:
Description: 一凸 8 边形P 的顶点顺时针为{v1，v2，… ，v8}，任意两顶点间的线段的权重由矩阵D 给出。
若vi 与vj 是P 上不相邻的两个顶点，则线段vivj 称为P 的一条弦。求P 的一个弦的集合T，
使得T 中所有的弦恰好将P 分割成互不重迭的三角形，且各三角形的权重之和为最小（一
个三角形的权重是其各边的权重之和）。
-A convex polygon P 8 vertex clockwise {v1, v2, ..., v8}, any two vertices of the segment between the weights given by the matrix D. If vi and vj are not adjacent to P on two vertices, then P is a line segment vivj called chord. Find P of a chord set T, such that T in all the strings happen to the P divided into non-overlapping triangles, and each triangle weights and the minimum (a triangular weighting of their respective weights of the edges and) .
Platform: |
Size: 4846592 |
Author: Eidn |
Hits:
Description: 从所给图形中分别抓取12个点，然后弦长参数化并利用控制顶点与型值点间的关系计算出迭代矩阵，以抓取到的点作为型值点分别用jaccobi和Gauss-seidel迭代法进行迭代，得到控制顶点。然后将给出的控制顶点与算出的控制顶点分别代入中得到P(t)和Q（t）,再采用二范数估计误差(According to the graphics respectively to grab 12 points, then the chord length parameterization and the control points and the value relations between points calculated by iterative matrix, to capture the point as the data points are iteratively using Jaccobi and Gauss-seidel iterative method, get the control points. Then, the control points and the calculated control points are substituted into P (T) and Q (T) respectively, and then the two norm estimation error is adopted)
Platform: |
Size: 1024 |
Author: 却温柔
|
Hits: