VLSI implementation of Phong shader in 3D graphics

Author(s):  
Hyun-Chul Sin ◽  
Jin-Aeon Lee ◽  
Lee-Sup Kim
Author(s):  
Badr Elkari ◽  
Hassan Ayad ◽  
Abdeljalil El Kari ◽  
Mostafa Mjahed

2009 ◽  
Vol 31 (3) ◽  
pp. 411-418
Author(s):  
Xin TIAN ◽  
Yi-Hua TAN ◽  
Jin-Wen TIAN

2010 ◽  
Vol 30 (2) ◽  
pp. 547-550 ◽  
Author(s):  
Shuai PENG ◽  
Dong-mei LI ◽  
Zhao-hui LI

2004 ◽  
Vol 14 (01) ◽  
pp. 83-97
Author(s):  
JONG-CHUANG TSAY

A parenthesis string is a string of left and right parentheses. The string is well-formed when it consists of balanced pairs of left and right parentheses. This study presents a novel systolic algorithm for generating all the well-formed parenthesis strings in lexicographical order. The algorithm is cost-optimal and is run on a linear array of processors such that each well-formed parenthesis string can be generated in three time steps. The processor array is appropriate for VLSI implementation, since it has the features of modularity, regularity, and local connection.


2012 ◽  
Vol 1 (3) ◽  
pp. 49-61 ◽  
Author(s):  
Michael Auer

Parallel processing methods in Geographic Information Systems (GIS) are traditionally used to accelerate the calculation of large data volumes with sophisticated spatial algorithms. Such kinds of acceleration can also be applied to provide real-time GIS applications to improve the responsiveness of user interactions with the data. This paper presents a method to enable this approach for Web GIS applications. It uses the JavaScript 3D graphics API (WebGL) to perform client-side parallel real-time computations of 2D or 2.5D spatial raster algorithms on the graphics card. The potential of this approach is evaluated using an example implementation of a hillshade algorithm. Performance comparisons of parallel and sequential computations reveal acceleration factors between 25 and 100, mainly depending on mobile or desktop environments.


Sign in / Sign up

Export Citation Format

Share Document