luebke

luebke

1. Luebke and Provan proved that the Euclidean 2-connected Steiner network problem is NP-hard, which means that there are few possibilities of existing a polynomial time algorithm for a general finite set P of points in the Euclidean plane.

Luebke和Provan证明了欧几里德2-连通Steiner网络问题是NP-困难的。 这意味着对一般的平面有限点集而言,不大可能存在求解这个问题的多项式时间算法。

2. This is the question that Benjamin Watson and David Luebke address in “The Ultimate Display: Where Will All the Pixels Come From?

就此问题，Benjamin Watson和David Luebke在文章“最终的显示：所有的象素从何而来？”

3. John D.Owens,David Luebke,Naga Govindaraju.A Survey of General-Purpose Computation on Graphics Hardware,EUROGRAPHICS,2005

罗玉宏,彭民德.分形图形库软件的设计与应用.微计算机应用,2002,23(3):