Search

Specific computing (SC) and diverse computing (DC), as two main visual computation manners, have been widely utilized in Media Cloud. However, how to choose SC or DC in a practical scenario is still an open and challenging problem. Unfortunately, the traditional fluid-based analysis method cannot address this issue due to the uncertain relationship between the computing manner and service dynamics. In this paper, we analytically study the characteristics of SC and DC by designing a so-called collapsing approximation (CA) method to precisely approximate the distribution of the service dynamics. On the qualitative end, we derive an exact expression for the dynamics of CA, thus enabling the cloud designer to choose different computing manners according to the application requests and analyze its impact on the degrees of DC. On the technical end, we show that the evolution of the service dynamics process can be approximated by the unique solution to a collapsing model over a finite time period. The highlight of this paper lies in demonstrating that the optimal computing configuration should largely depend on SC, and a little on DC. [ABSTRACT FROM AUTHOR]

Many applications require manipulation and visualization of complex and highly detailed models at realtime. In this paper, we present a new mesh process and rendering method for realtime high quality rendering. The basic idea is to send a simplified mesh to hardware pipeline, while use the online tessellation on the GPU to facilitate the rendering of complex geometric details. We formulate it into an inverse tessellation problem that first computes the simplified mesh, and then optimizes the tessellated mesh with geometric details to approximate the original mesh. To solve this problem, we propose a two-stage algorithm. In the first stage, we employ an iterative surface simplification technique, where we take the requirement of hardware tessellation into consideration to obtain an optimal simplified mesh. In the second stage, to better utilize the hardware tessellation, we propose a moving vertex strategy to approximate the tessellated mesh to the original mesh. Results show that our method achieves 2–4 times faster at rendering but still retains high quality geometrical details. [ABSTRACT FROM AUTHOR]