No abstract

A novel ellipse sampling technique is presented. The technique is efficient, stratified, low distortion and works for both polar and concentric maps between a square and an ellipse. The technique preserves adjacency and fractional area, does not require any numerical computation and has proven to be feasible in Monte Carlo applications

No abstract

We present a progressive refinement system for rendering direct illumination at interactive rates for dynamic scenes using available graphics APIs. We achieve the progression by subdividing object surfaces using a quad-tree approach. Integrating the visibility and illumination, we can render scenes with soft shadows, taking into account the BRDFs of the scene objects. Our system allows a user to specify the desired frame rates, and the system will achieve such rates with the available time budget. Our system can also render dynamic scenes where the system restores the initial meshes and calculates illumination, producing finer but accurate soft shadows during iterative refinements.

Abstract. We present a data hiding algorithm for 3D models. It is based on a substitutive procedure in the spatial domain. We propose a Virtual Multi-Level Embed Procedure to embed information based on shifting the message point by its virtual geometrical property, the order of which is assigned by principal component analysis. We have defined and validated an effective metric of distortion anticipation, which can help us easily anticipate and control the distortion rate. Experimental results show that the proposed technique is efficient and secure, has high capacity and low distortion, and is robust against affine transformations. It provides a reversible method and has proven to be feasible in data hiding.