Location:
Search - MATLAB VERTICES
Search list
Description: 运用de Casteljau递归求值法编写三角形域上的n次Bezier曲面计算程序，给定 控制顶点-de Casteljau using recursive method for the preparation of the triangle domain n Bezier surface calculation procedures for determining control vertices
Platform: |
Size: 1024 |
Author: jo Wang |
Hits:
Description: de Boor 求值算法求作二次和三次B-样条插值曲线，Hartley-Judd法确定节点矢量，使用基于基的运算的插值法求控制顶点-algorithm evaluates demand for secondary and cubic B-spline interpolation curve, Hartley-Judd determine node vector-based computing interpolation method for the control vertices
Platform: |
Size: 5120 |
Author: jo Wang |
Hits:
Description: 图论中最小生成树Kruskal算法 及画图程序 M-函数
格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图
例如
n=6 w=inf*ones(6)
w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3]
w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6
[a,b]=mintreek(n,w)
-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5] w (2, [3,5]) = [5,3] w (3, [4,5,6]) = [5,6,4] w (4,6) = 2 w (5,6) = 6 [a, b] = mintreek (n, w)
Platform: |
Size: 1024 |
Author: lluo |
Hits:
Description: 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。-Single-source shortest path problem: a given weighted directed graph G = (V, E). Given a vertex V in v, known as the source. To calculate from the source to all other vertices of the shortest path length.
Platform: |
Size: 1024 |
Author: 忠波 |
Hits:
Description: 使用FLORD算法求解任意两顶点间最短路的MATLAB程序示例代码-FLORD algorithm using arbitrary shortest path between two vertices of the MATLAB program sample code
Platform: |
Size: 1024 |
Author: 何金深 |
Hits:
Description: Export a vertices/faces patch to an STL triangular mesh.This is based heavily on Bill McDonald s previous work, simply enabling his output functions for a different form of input.
Platform: |
Size: 1024 |
Author: aprist |
Hits:
Description: 初学者设计的matlab顶点问题着色问题gui解决，要求输入顶点个数，可计算色多项式，及染色方法-Matlab beginners designed gui question vertex coloring problem resolved for the importation of the number of vertices, chromatic polynomial computable, and staining
Platform: |
Size: 16384 |
Author: 丰占军 |
Hits:
Description: matlab计算任意多边形面积POLYAREA(X,Y)-POLYAREA(X,Y) returns the area of the polygon specified by the vertices in the vectors X and Y.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: Matlab code to view the image of a triangle under different views given the coordinates and color of its vertices. Colors inside triangle are found by interpolation
Platform: |
Size: 3072 |
Author: ruchir |
Hits:
Description: 有限元方法分析典型结构,采用六节点三角形单元-This programming give an order 6 triangulation, an abstract list of sets
of six nodes. The vertices are listed clockwise, then the midside nodes.
Platform: |
Size: 1024 |
Author: tianjun |
Hits:
Description: 这是在MATLAB-2008a环境下编写的NURBS曲面生成程序，可以通过调整控制顶点和各个顶点的权重来调整曲面的形状。-This is a MATLAB-2008a environment, prepared by the NURBS surface generation program, you can adjust the control points and weights of all vertices to adjust the surface shape.
Platform: |
Size: 278528 |
Author: 小胡 |
Hits:
Description: 求第一个城市到其它城市的最短路径.用矩阵（为顶点个数）存放各边权的邻接矩阵，行向量、、、分别用来存放标号信息、标号顶点顺序、标号顶点索引、最短通路的值-The first city to find the shortest path to other cities. With a matrix (for the number of vertices) records of the right side of the adjacency matrix, row vector, were used to store label information and label the vertex order, label the vertex indexes, the shortest pathway value
Platform: |
Size: 1024 |
Author: 秦莉平 |
Hits:
Description: 图与网络论中求最短路径的Dijkstra算法 M-函数
格式 [S,D]=minroute(i,m,W)
i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵，
不构成边的两顶点之间的权用inf表示。显示结果为：S的每
一列从上到下记录了从始点到终点的最短路径所经顶点的序号；
D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-function the format [S, D] = minroute (i, m, W) i is the starting point of the shortest path, m is the graph vertices, W is the graph with adjacency matrix power, does not constitute the edge between two vertices of the right to use the inf that. Showing results: S a top to bottom of each record from the beginning to the end point of the shortest path through the vertices of the serial number D is a row vector to record the path shown in the size of S
Platform: |
Size: 1024 |
Author: 童康 |
Hits:
Description: 此MATLAB文件专门用于求某个顶点到其他顶点的最短距离-This MATLAB file dedicated to seeking the shortest distance of a vertex to other vertices
Platform: |
Size: 1024 |
Author: 王华 |
Hits:
Description: 由点云数据（point cloud）生成网格（mesh）的matlab实现-Converts a pointcloud (unordered vertices) to a mesh of triangles by connecting the nearest 3 points and calculates the normal of each vertex and triangle. Also finds the neighboring triangles of each vertex and the neighboring triangles of each triangle.
Platform: |
Size: 2048 |
Author: tc |
Hits:
Description: 关于复杂网络中的Betweenness，用matlab计算。-betweenness_centrality(A) returns the betweenness centrality for all vertices in A.
Platform: |
Size: 1024 |
Author: 李涛 |
Hits:
Description: FDTD的功能实现，含有中文注释，设置吸收边界和顶点-FDTD realization of the function containing Chinese notes, absorbing boundary and vertices
Platform: |
Size: 1024 |
Author: spray |
Hits:
Description: Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。(The Floyd algorithm, also called the Freud algorithm and the insertion point method, is an algorithm for finding the shortest path between the vertices in a given weighted graph.)
Platform: |
Size: 2048 |
Author: dummy0626 |
Hits:
Description: 通过随机移动规则六边形的顶点创建二维不规则多边形晶粒；并且能够统计得到晶粒粒径分布；(By randomly moving the vertices of regular hexagons, two-dimensional irregular polygonal grains are created; and the grain size distribution can be statistically obtained.)
Platform: |
Size: 481280 |
Author: 2018gogogo |
Hits:
Description: 独立集是指图 G 中两两互不相邻的顶点构成的集合。任意有关图中团的性质都能很自然的转述成独立集的性质。一般而言，寻找图的最大团是 NP 困难的，从而寻找图的最大独立集也是 NP 困难的。用模拟退火算法找出图的最大独立集。(Independent set is a set of vertices in graph G that are not adjacent to each other. The properties of cliques in any graph can be naturally expressed as the properties of independent sets. Generally speaking, it is NP-hard to find the maximum clique of a graph, so it is NP-hard to find the maximum independent set of a graph. Simulated annealing algorithm is used to find the maximum independent set of graphs.)
Platform: |
Size: 1024 |
Author: mr_xia |
Hits: