登录
首页 » 图形图像 » Radiosity+

Radiosity+

于 2022-02-05 发布 文件大小:4.11 MB
0 239
下载积分: 2 下载次数: 1

代码说明:

辐射度模型,3D图形学当中有关辐射度模型的具体描述-Radiosity+-+A+Programmer_ s+Perspective

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • windows图形编程源码,含有几十个图形编程的程序例子
    windows图形编程源码,含有几十个图形编程的程序例子
    2023-03-08 22:15:03下载
    积分:1
  • Voxel Scape 2.0 in C
    Voxel Scape 2.0 in C
    2023-03-07 14:20:02下载
    积分:1
  • X264解码平台 很好的C代码 在VC环境下运行
    X264解码平台 很好的C代码 在VC环境下运行-X264 decoder platform good C code running in VC environment
    2022-02-01 22:03:30下载
    积分:1
  • VTK用户指南中文版图像的第六章和三
    vtk user guide中文版第六章 图像及三维体数据的可视化-vtk user guide Chinese version of Chapter VI of the image and three-dimensional volume data visualization
    2022-03-25 18:40:51下载
    积分:1
  • 车辆识别
    基于opencv的车辆识别,原理主要是通过opencv的轮廓检测识别车辆轮廓,然后再检测车辆,效果不错
    2023-01-08 12:30:02下载
    积分:1
  • 用turboc2闲时编的图形学用的显示直线的程序
    用turboc2闲时编的图形学用的显示直线的程序-turboc2 the man with a series of graphics showing the straight procedures
    2022-01-25 15:57:14下载
    积分:1
  • 非常实用的配色表,方便j2me程序员调色。节省开发时间
    非常实用的配色表,方便j2me程序员调色。节省开发时间-A very useful color table to facilitate j2me programmers color. Save development time
    2022-08-18 07:38:25下载
    积分:1
  • 内存演示程序
    内存演示程序-Memory demo program
    2023-07-18 14:50:02下载
    积分:1
  • a simple drawing tools can refer to the realization of the basic graphics learni...
    一个简单的绘图工具的实现 可以参考学习图形学基本算法-a simple drawing tools can refer to the realization of the basic graphics learning algorithm
    2022-03-11 18:34:36下载
    积分:1
  • 本文讨论了一个随机的
    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.-This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum#ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
    2022-09-22 09:45:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载