Location:
Search - cg.d
Search list
Description: CG做的迷宫游戏,可以用键盘转变视角等.
You can enter:
w for up to see the sence
x for down to see the sence
a for seeing left side of the sence
d for seeing right side of the sence
z for zooming the sence
c for shuming the sence
s for changing the sence from Solid to Wire
Keys 上下左右 to move the ball up/down/left/right
-CG done maze game, you can use the keyboard, such as changes in perspective. You can enter : w for up to see the sence for x down to see the sence for seeing a left side of the sence for seeing ri d ght side of the sence for zooming z c for the sence shuming the sence's for changing the sence from S olid next to Wire Keys around to move the ball up / down / l eft / right
Platform: |
Size: 11594 |
Author: 顾玮 |
Hits:
Description: CG做的迷宫游戏,可以用键盘转变视角等.
You can enter:
w for up to see the sence
x for down to see the sence
a for seeing left side of the sence
d for seeing right side of the sence
z for zooming the sence
c for shuming the sence
s for changing the sence from Solid to Wire
Keys 上下左右 to move the ball up/down/left/right
-CG done maze game, you can use the keyboard, such as changes in perspective. You can enter : w for up to see the sence for x down to see the sence for seeing a left side of the sence for seeing ri d ght side of the sence for zooming z c for the sence shuming the sence's for changing the sence from S olid next to Wire Keys around to move the ball up/down/l eft/right
Platform: |
Size: 1925120 |
Author: 顾玮 |
Hits:
Description: 图的深度遍历，输出结果为（红色为键盘输入的数据，权值都置为1）：
输入顶点数和弧数:8 9
输入8个顶点.
输入顶点0:a
输入顶点1:b
输入顶点2:c
输入顶点3:d
输入顶点4:e
输入顶点5:f
输入顶点6:g
输入顶点7:h
输入9条弧.
输入弧0:a b 1
输入弧1:b d 1
输入弧2:b e 1
输入弧3:d h 1
输入弧4:e h 1
输入弧5:a c 1
输入弧6:c f 1
输入弧7:c g 1
输入弧8:f g 1
深度优先遍历: a b d h e c f g
程序结束.
-Traverse the depth chart, the output results (red for the keyboard input data, weights are set to 1): Enter the number of Vertices and arcs: 8 9 input vertex 8. Input vertex 0: a input vertex 1: b input Vertex 2: c input vertex 3: d input vertex 4: e input vertex 5: f input vertex 6: g Enter the Vertex 7: h input arc 9. input arc 0: ab 1 input arc 1: bd 1 input arc 2: be 1 input arc 3: dh 1 input arc 4: eh 1 input arc 5: ac 1 input arc 6: cf 1 input arc 7: cg 1 input arc 8: fg 1 depth-first traversal: abdhecfg end of the process.
Platform: |
Size: 1024 |
Author: Louis |
Hits:
Description: cg图形编程示例程序d。-cg graphics programming examples procedures d.
Platform: |
Size: 364544 |
Author: liu |
Hits:
Description: cg.dll.cggl.dll.opengl开发必须的两个动态连接库！很好很-development must cg.dll.cggl.dll.opengl two Dynamic Link Library! Very good
Platform: |
Size: 536576 |
Author: lbo |
Hits:
Description: 计算机图形学(Computer Graphics，简称CG)是一种使用数学算法将二维或三维图形转化为计算机显示器的栅格形式的科学。简单地说，计算机图形学的主要研究内容就是研究如何在计算机中表示图形、以及利用计算机进行图形的计算、处理和显示的相关原理与算法。
-Computer Graphics (Computer little, abbreviation CG) is a kind of the use of mathematical algorithms will of 2-d or 3-d Graphics into Computer monitors raster forms of science. Say simply, computer graphics the main research contents is about how in computer graphics, and said in use computer graphic calculation, process and display of related principles and algorithm.
Platform: |
Size: 7705600 |
Author: 元又 |
Hits:
Description: This Program Deals With All Two-D Transformation Such As Translation, Scaling, Rotation,
Reflection, Shearing In Homogeneous Coordinates.
3-D Transformation
bresenham line drawing
polygon filling
polygon clipping
Platform: |
Size: 9216 |
Author: gori_17 |
Hits:
Description: 计算机图形学(Computer Graphics，简称CG)是一种使用数学算法将二维或三维图形转化为计算机显示器的栅格形式的科学。简单地说，计算机图形学的主要研究内容就是研究如何在计算机中表示图形、以及利用计算机进行图形的计算、处理和显示的相关原理与算法。是计算机科学的一个分支领域，主要关注数字合成与操作视觉的图形内容。-2 d line drawing generation algorithm
Platform: |
Size: 238592 |
Author: 梅争奇 |
Hits:
Description: CG算法，需要Q矩阵或者D 矩阵的可以私聊(CG calculation CG algorithm, the Q matrix or the D matrix can be used for private chat)
Platform: |
Size: 146432 |
Author: 王二萌萌哒
|
Hits:
Description: BFGS算法(BFGS algorithm)，是一种逆秩2拟牛顿法。Hk+，满足拟牛顿方程的逆形式Hk+}少一、k=s.当Hk正定且(，'，少)}0时Hkh，也正定，因此，由BFGS修正确定的算法xk+} - xk - HkF Cxk)是具有正定性、传递性的拟牛顿法，它也是无约束优化中最常用的、最稳定的算法之一这种算法是布罗依丹(Broy-den,C. G.)于1969年，以及弗莱彻(Fletcher , R. ) ,戈德福布(Goldforb,D. )、香诺(Shan no, D. F.)于1970年分别得到的，故称为BFGS算法.(The BFGS algorithm is an inverse rank 2 quasi-Newton method.Hk +, to satisfy the inverse form of the quasi-Newton equation Hk +} less one, k = s. When Hk is definite and (, ', less)} 0 Hkh, is also positive definite, therefore, the algorithm determined by the BFGS correction xk +} - xk - HkF Cxk) is a quasi-Newton method with positive definiteness and transitivity. It is also one of the most commonly used and most stable algorithms in unconstrained optimization. This algorithm was Broy-den (CG) in 1969, and Fletcher (R.), Goldforb (D.), and Shanno (DF) were obtained in 1970 respectively, hence the BFGS algorithm.)
Platform: |
Size: 1024 |
Author: ranin |
Hits: