搜索资源列表
JGE_Engine_Source_and_Demo(v0.01b)
- PSP上的2D开发库 JGE++ 簡介: PSP上有一個獨立的GPU, 在我們編寫遊戲時, 要是能把有關圖像處理的工作都交給GPU做, 就可以減輕主處理器的很多負擔, 令整體程序的運\作, 得到數倍的提升! JGE++ (Jas Game Engine) 就是一個利用GU 庫寫成的2D遊戲引擎, GU庫的原本用途是用作編寫3D遊戲, 我們把它應用在2D遊戲上, 就可以享用硬件加速所帶來的種種好處, 例如運\行速度的提升, 混色/半透明色效果, 圖像放大縮小和旋轉等!
CurvePainter
- n次贝塞尔曲线及三次b样条曲线的绘制，使用自己编写的curve类，实现曲线上点坐标的计算与绘制，曲线点坐标的计算使用递归算法。点击左键设定控制点，之后点击右件绘制曲线。-n Bessel curve and three b-spline curve mapping, prepared to use their own type of curve, curve coordinates of the point on the calculation and drawing, curve coordi
curve_test.tar
- curve_test is a set of 3 programs to demonstrate 3 different kind of third-order parametric curves: Hemite curve segments, Bezier curve segments, and Splines. Hemite curves are defined by two endpoints and two vectors, Bezier curves are defi
oscill_src
- This a simple implementation of Oscilloscope control. This control shows last N points of user data. It has up to 8 channels (number of channels are defined by OSC_MAX_CHANNELS parameter in header file). Each channel can show only one curve (in this
Aaform
- Aaform (Anti Aliased Image Transformation) is a technique I have developped for transforming a rectangular bitmap into any quadralateral (Including Convex/Complex quadralaterals). I believe that this is the optimal way to transform images that exists
C
- cout< \"a.b两点之间的距离\"<<a.dis(b)<<\"\\n\"
CalcQieDian2
- 圆心(a,b),半径r 圆外一点坐标(m,n) 求其切点的坐标(x,y)
CalcQieDian3
- 三点A，B，C (坐标A.x, A.y ......) A、B是矩形的两端点 且C在与AB平行的 矩形另一边上 或其延长线上 求矩形另外两端点M、N 再求与MN夹角为45度，与M距离为10的点P 以及与MN夹角45度，与N距离为10的点Q 注：P、Q都在矩形内部
mydwt2
- 2-D 多级非标准小波分解程序：输入X是要求分解的二维信号，wavename 是用来做分解的小波名称，与matlab的wavename定义一致 N 为分解级数
program_1
- 图片模糊处理的例程，通过对n*n的pixel矩阵数据排序，进行中值变换，获得平缓过渡的图片。 排序程序可使用多种算法，实现的有冒泡、快速排序算法。
inpoly
- This code is described in \"Computational Geometry in C\" (Second Edition), Chapter 7. It is not written to be comprehensible without the explanation in that book. This program reads a polygon P followed by query points from stdin. The in
delaunay
- void CDelaunayView::OnDelaunay() { // TODO: Add your command handler code here CDelaunayDoc* pDoc = GetDocument(); ASSERT_VALID(pDoc); if(!pDoc->PointList->GetCount()) { char str[100]; ostrstream osr(str,100); osr<&
ArcPartDemo
- 计算圆弧上n个等分点的坐标的函数，及使用示例代码，VC环境，属于二维图形基础算法，加有详细的注释。 输入：圆心,起点,终点,半径,旋转方向,点数量n。 输出：圆弧上n个等分点坐标的数组, 说明：输出的起点序号为0，终点序号为n-1 -Calculate arc n are equally a function of the coordinates of points, and use the sample code, VC environment, belonging to
contourlet_toolbox.tar
- 这是一个contourlet工具箱，用来对contourlet变换进行了解和应用-Contourlet toolbox: a MATLAB toolbox for computing the contourlet transform and its applications. The contourlet transform is described in: The contourlet transform: an efficient directional multiresolution im
ComputerGraphics
- 是我的计算机图形学的大作业，其中包括的算法有： 直线绘制的DDA算法，bresenham算法，中点算法，绘制圆和椭圆的中点算法，扫描线种子填充算法。N次贝塞尔曲线的绘制以及对他的平移旋转和缩放变换。还有颜色对话框的调用等等，操作方法在帮助里也写明了。另外，还附有一个编写说明书，适合初学者一步步的自己编写出程序来。-Is my great work in computer graphics, including the algorithm are: line drawing of the DDA
CircleFitByPratt
- Input: XY(n,2) is the array of coordinates of n points x(i)=XY(i,1), y(i)=XY(i,2) Output: Par = [a b R] is the fitting circle: center (a,b) and radius R Note: this fit does not use built-in matrix functions (except "mean"), so it can be
TrianglePro
- 输入n个点 判断是否能形成凸多边形 并给出三角划分-Enter the n points to determine whether to form a convex polygon and give triangulation
ncc
- The normalized cross correlation (NCC) implemented in C++ and Matlab
fftInterpolate
- Performs N-D FFT interpolation any data for which fftn works. Will upsample by zero-filling, downsample by truncating high frequencies, or combine both up- and downsampling by dimension to allow arbitrary reshaping.-Performs N-D FFT interpolation on
wavecompression
- The following implementation steps have been made for the devised algorithm, which is based on 2D-wavelet. 1. Reading an image of either gray scale or RGB image. 2. Converting the image into grayscale if the image is RGB. 3. Decomposition of im