著名的Hilber 曲线和Sierpinski曲线,JAVA实现.体现递归算法和JAVA中的绘图功能.-famous Hilber curve and Sierpinski curves, JAVA. recursive algorithm embodied in Java and graphics functions. 下载
|
J2me唆哈的代码，包括了算法、图形绘制。 -J2me suck the code, including the algorithms, graphics rendering. 下载
|
计算机图形学,利用DDA算法,中点画线算法,实现直线的绘制-computer graphics, the use of DDA algorithm, which dotted line algorithm, achieving a linear mapping 下载
|
全面运用所学的JAVA理论对所设计的类进一步完善，并学会使用数组存储游戏地图数据，并能运用图形绘制方法和一定的算法将地图在游戏中绘制出来，并能控制游戏角色在地图可行走区域运动。-comprehensive study of the use of Java theory designed to further improve the class, and learning how to use the array game map data storage, and will be able to use graphic drawing methods and certain algorithm maps for the game mapped, and can control the game in the role of maps can be running regional campaign. 下载
|
计算机图形学,中点画圆法,利用八分圆绘制圆-computer graphics, the midpoint Circle, using interval mapping Yuan Yuan 下载
|
这是我图形学的综合实习程序,里面实现直线的dda算法,中点Bresenham算法,改进Bresenham算法的绘图,椭圆的中点Bresenham算法,圆的八分画圆结合中点Bresemham算法的绘制,并包含了图形的翻转,平移,对称,比例变换,内有说明文档-integrated graphics attachment procedures, straight line inside the dda algorithm, the midpoint of Bresenham algorithm, improving the Bresenham algorithm for mapping, elliptical midpoint Bresenham algorithm, the eighth round midpoint Bresemham Circle combining algorithm mapping, and includes graphics and overturned, translational symmetry, Transform ratio, which is documented 下载
|
一个绘制Voronoi图和Delauany三角剖分的程序，并且给出了求凸包的算法。该程序可以演示如何进行三角剖分，帮助你理解整个剖分过程。-a Voronoi diagram mapping and triangulation Delauany procedures, and is seeking a convex hull algorithms. The procedure can demonstrate how triangulation, and help you understand the subdivision process. 下载
|
三维空间中的分形插值算法 ① 在X-Y平面上绘制一个n×n的正方形网格，并对4个角点在Z方向上分别设置初始高度ha，hb，hc，hd，得到A，B，C，D这4点（如图10.3所示）。 ② 根据式hm=（ha+hb+hc+hd）/4+△，计算正方形网格中点的高度hm，其中△为一随机量，从而得到M点。 ③ 根据角点和中点以及虚拟点，计算边中点的高度，即 he=(ha+hb+hm+0)/4+△ hf=(hb+hc+hm+0)/4+△ hg=(hc+hd+hm+0)/4+△ hh=(hd+ha+hm+0)/4+△ 其中，△为一随机量，从而得到E，F，G，H这4点。 ④ 再根据E，B，F，M4点的高度计算小正方形EBFM中点的高度，类似地计算小正方形MFCG，HMGD，AEMH中点的高度，即 he’=(ha+hb+hm+he)/4+△1 hf ’=(hb+hc+hm+hf)/4+△1 hg’=(hc+hd+hm+hg)/4+△1 hh’=(hd+ha+hm+hh)/4+△1 以及这些正方形边中点的高度。 ⑤ 递归步骤③和步骤④使正方形网格逐步细化，直至达到预期递归深度，然后连接每个正方形网格点。 - 下载
|
电脑中的花园 Lindermayer系统（简称L系统）是另外一种分形图形生成的方法，其主要原理是设定基本简单的绘图规则，然后让计算机根据这些规则进行反复跌代，就可以生成各种各样的图形来。用L系统可以非常逼真的模拟植物的生长过程。上面的程序就是L系统的一个展示。我们已经设定好了一个规则库，你可以通过选择不同的规则画出不同的图形来，同时，你可以通过“设置参数”来改变这些规则从而画出你自己的图形来！ -computers garden Lindermayer System (L) is another kind of fractal graphics Health 10% of the method, its main principle is to set basic, simple mapping rules then let the computer under their rules or substituting repeatedly, it can generate a variety of graphics to. L system can be very realistic simulation of plant growth process. The above procedure is an L-system display. We have established a good rule base, you can choose different rules paint a different graphics to the same time, you can use the "set parameters" to change the rules so as to draw your own graphics! 下载
|
使用绘制圆弧的方法，输出一个统计图表“圆饼图”和一个“折扇”。 原始数据在数组Data中，这5个数据在圆饼图中为角度不同的扇形，各自角度的计算值分别为38、91、54、125、53，放在数组drgree中。第一个数据的扇形起始角start=0，用绿色画。第二个的起始角start=38，用蓝色画。最后一个的起始角start=308，用橙色画。 折扇的画法是：在左上角坐标（130，40），长150，宽80的椭圆区域内，从22度开始逆时针地画一个15度的扇性，再画一段15度的椭圆弧；然后交替地画扇形和圆弧。-use mapping arc method, output a statistical charts, "Yuan pie" and a "folding fans." The raw data in the array Data, this data in the five round pie for the fan perspective, the perspective of their respective values were calculated 38,91,54,125,53, on the array were drgree. No. 1 fan initial data Kok start = 0, green painted. The second start of the initial angle = 38, painted blue. A final start of the initial angle = 308, with orange painting. Folding fans of paint is : in the upper left corner coordinates (130,40), 150 long, wide oval region of 80, from 22 degrees to start painting an anti-clockwise 15 degrees fan, painting section 15 of ellipse; Then turn to the fan-shaped and painted arc. 下载
|