Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
Quadratic surface rendering on a logic-enhanced frame-buffer memory system
IEEE Computer Graphics and Applications
Fast constructive-solid geometry display in the pixel-powers graphics system
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
A systolic evaluator for linear, quadratic, and cubic expressions
Journal of Parallel and Distributed Computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fast spheres, shadows, textures, transparencies, and imgage enhancements in pixel-planes
SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
An algorithm for VLSI implementation of highly efficient cubic-polynomial evaluation
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
IEEE Parallel & Distributed Technology: Systems & Technology
A self-adjusting clock tree architecture to cope with temperature variations
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
SACTA: a self-adjusting clock tree architecture for adapting to thermal-induced delay variation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 14.98 |
Two types of organizations are presented for frame buffers of m*m pixels: one is a single wavefront complex cell array requiring O(m/sup 2/n) space and the other is a simple cell multiple wavefront array with O(m/sup 2/) area and O(n/sup 2/) wavefronts. Both these organizations have two main advantages over an earlier method: the cells and the interconnection among them are regular and hence are suitable for efficient VLSI implementation, and the organization permits evaluation of higher-order polynomials.