CG
文章平均质量分 79
jinzhilong580231
这个作者很懒,什么都没留下…
展开
-
纹理的定义
转自:http://cg.sjtu.edu.cn/lecture_site/chap9/mainframe971.htm#1 离散法定义用离散法定义纹理较为常用,它将纹理图象数据定义在一个二维数组中,这个数组可以是各种图形或图象。用这种方法定义的纹理,方法灵活,修改也方便,比较适合于交互式系统的纹理映射显示。连续函数法定义:任何定义在二维转载 2012-04-09 21:09:59 · 2000 阅读 · 0 评论 -
Texture mapping
转自:http://en.wikipedia.org/wiki/Texture_mappingTexture mappingTexture mapping is a method for adding detail, surface texture (a bitmap orraster image), orcolor to acomputer-generated graphic o转载 2012-04-10 17:05:08 · 1186 阅读 · 0 评论 -
Lightmap
转自:http://en.wikipedia.org/wiki/LightmapLightmapA lightmap is a data structure which contains the brightness of surfaces in 3d graphics applications such asvideo games. Lightmaps are precomputed转载 2012-04-10 09:51:41 · 754 阅读 · 0 评论 -
k-d tree
转自:http://en.wikipedia.org/wiki/K-d_treek-d treeIn computer science, a k-d tree (short for k-dimensionaltree) is a space-partitioning data structure for organizing points in a k-dime转载 2012-04-20 15:15:00 · 1671 阅读 · 1 评论 -
Core Data-Structure Layer
转自:http://www.iue.tuwien.ac.at/phd/binder/node53.html3.4Core Data-Structure LayerThis layer is responsible forholding the data describing the Wafer in memory and providing the functional转载 2012-05-09 11:00:04 · 740 阅读 · 0 评论 -
CGAL编程实现点集的Delaunay三角剖分和Voronoi图
转自:http://www.cnblogs.com/sudoleo/archive/2010/07/20/1781617.html//使用CGAL编程实现点集的Delaunay三角剖分,voronoi图//如果对Delaunay算法本身关注,请参考CGAL对Delaunay三角剖分的实现,CGAL对Delaunay三角剖分的实现是增量算法(Incremental)//本程序的重点在于对转载 2011-09-04 08:18:30 · 9200 阅读 · 3 评论