Computer generated hologram from point cloud using graphics processor

Computer generated holography is an extremely demanding and complex task when it comes to providing realistic reconstructions with full parallax, occlusion, and shadowing. We present an algorithm designed for data-parallel computing on modern graphics processing units to alleviate the computational burden. We apply Gaussian interpolation to create a continuous surface representation from discrete input object points. The algorithm maintains a potential occluder list for each individual hologram plane sample to keep the number of visibility tests to a minimum.We experimented with two approximations that simplify and accelerate occlusion computation. It is observed that letting several neighboring hologramplane samples share visibility information on object points leads to significantly faster computation without causing noticeable artifacts in the reconstructed images. Computing a reduced sample set via nonuniform sampling is also found to be an effective acceleration technique. © 2009 Optical Society of America.

Computer Simulation Of Random Sphere Packing In An Arbitrarily Shaped Container

Most simulations of random sphere packing concern a cubic or cylindric container with periodic boundary, containers of other shapes are rarely studied. In this paper, a new relaxation algorithm with pre-expanding procedure for random sphere packing in an arbitrarily shaped container is presented. Boundaries of the container are simulated by overlapping spheres which covers the boundary surface of the container. We find 0.4 similar to 0.6 of the overlap rate is a proper value for boundary spheres. The algorithm begins with a random distribution of small internal spheres. Then the expansion and relaxation procedures are performed alternately to increase the packing density. The pre-expanding procedure stops when the packing density of internal spheres reaches a preset value. Following the pre-expanding procedure, the relaxation and shrinking iterations are carried out alternately to reduce the overlaps of internal spheres. The pre-expanding procedure avoids the overflow problem and gives a uniform distribution of initial spheres. Efficiency of the algorithm is increased with the cubic cell background system and double link data structure. Examples show the packing results agree well with both computational and experimental results. Packing density about 0.63 is obtained by the algorithm for random sphere packing in containers of various shapes.

Computer simulation of influence of sedimentation on rapid coagulation

A computer simulation was performed to explore the features and effects of sedimentation on rapid coagulation. To estimate the accumulated influence of gravity on coagulation for dispersions, a sedimentation influence ratio is defined. Some factors possibly related to the influence of sedimentation were considered in the simulation and analysed by comparing the size distribution of aggregates, the change in collision number, and coagulation rates at different gravity levels (0 g, 1 g and more with g being the gravitational constant).

Computer simulation on the collision-sticking dynamics of two colloidal particles in an optical trap

Collisions of a particle pair induced by optical tweezers have been employed to study colloidal stability. In order to deepen insights regarding the collision-sticking dynamics of a particle pair in the optical trap that were observed in experimental approaches at the particle level, the authors carry out a Brownian dynamics simulation. In the simulation, various contributing factors, including the Derjaguin-Landau-Verwey-Overbeek interaction of particles, hydrodynamic interactions, optical trapping forces on the two particles, and the Brownian motion, were all taken into account. The simulation reproduces the tendencies of the accumulated sticking probability during the trapping duration for the trapped particle pair described in our previous study and provides an explanation for why the two entangled particles in the trap experience two different statuses. (c) 2007 American Institute of Physics.

Collective evolution characteristics and computer simulation of short fatigue cracks

Fatigue testing was conducted using a kind of triangular isostress specimen to obtain the short-fatigue-crack behaviour of a weld low-carbon steel. The experimental results show that short cracks continuously initiate at slip bands within ferrite grain domains and the crack number per unit area gradually increases with increasing number of fatigue cycles. The dispersed short cracks possess an orientation preference, which is associated with the crystalline orientation of the relevant slip system. Based on the observed collective characteristics, computer modelling was carried out to simulate the evolution process of initiation, propagation and coalescence of short cracks. The simulation provides progressive displays which imitate the appearance of experimental observations. The results of simulation indicate that the crack path possesses a stable value of fractal dimension whereas the critical value of percolation covers a wide datum band, suggesting that the collective evolution process of short cracks is sensitive to the pattern of crack site distribution.

Unraveling Public Good Games: The Role of Priors

This paper provides experimental evidence on how players predict end game effects in a linear public good game. Our regression analysis yields a measure of the relative importance of priors and signals on subjects\' beliefs on contributions and allow us to conclude that, firstly, the weight of the signal is relatively unimportant, while priors have a large weight and, secondly, priors are the same for all periods. Hence, subjects do not expect end game effects and there is very little updating of beliefs.

On monotonic core allocations for coalitional games whith veto players

We characterize a monotonic core concept defined on the class of veto balanced games. We also discuss what restricted versions of monotonicity are possible when selecting core allocations. We introduce a family of monotonic core concepts for veto balanced games and we show that, in general, the nucleolus per capita is not monotonic.