This a reflection model (BRDF) viewer written by students in the course 15-860. See http://www.cs.cmu.edu/afs/cs/project/classes-ph/860.96/pub/www/860.html for info on the course.

huffman_f 在huffman_e的基础上，将排序改为利用堆排序原理选择最小的两个权值。也即，将所有元素的权值组织成堆后，每次堆内的根结点就是最小值了。每取出一个根结点后，就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后，再把子树作为叶子结点放到堆中，并让其上升到合适的位置，保持堆性质不变。因为每次不必完成整个排序过程，而只是组织成堆，因此，这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现，见http://www.cs.mu.oz.au/m

jpeg压缩与解码的小程序，vc下开发的。//Name:compress.c//Purpose: Run length algorithm and Jpeg decoding//Author: phoenix, CS, TshingHua, Beijing, P.R.C.//Email: bjlufengjun@www.163.net or lufengjun@hotmail.com//Date:April 3, 1998-a small programme of jpeg codec and

//Name:smooth.c//Purpose: To perform smoothing and sharpening//Author: phoenix, CS, TshingHua, Beijing, P.R.C.//Email: bjlufengjun@www.163.net or lufengjun@hotmail.com//Date:April 3, 1998

//Name:geotrans.c//Purpose: To perform geometric transform//Author: phoenix, CS, TshingHua, Beijing, P.R.C.//Email: bjlufengjun@www.163.net or lufengjun@hotmail.com//Date:April 3, 1998