10 results
Search Results
Now showing 1 - 10 of 10
Item A New Algorithm of Space Tracing Using a CSG Model(Eurographics Association, 1987) Bouatouch, Kadi; Madani, M.O.; Priol, Thierry; Arnaldi, BrunoThis paper describes a new algorithm of space tracing. Scenes are modeled by a CSG tree. Space is subdivided regularly into 3D regions called boxes. With each box is associated a subtree which is the restriction of the whole scene CSG tree to primitives belonging to this box. A 3D grid is used to access boxes.Item An adaptive Discretization Method For Radiosity(Blackwell Science Ltd and the Eurographics Association, 1992) Languenou, Eric; Bouatouch, Kadi; Tellier, PierreWhen using radiosiiy, the visual quality of the rendered images strongly depends on the method employed for discretizing the scene into patches. A too fine discretization may give rise to artifacts, while with a coarse discretization areas with high radiosity gradient may appear. To overcome these problems, the discretization must adapt to the scene. That is, the interaction between two patches must account for the distance between them as well as their surface area. In other words, surfaces far away are discretized less finely than nearby surfaces. These aspects are considered by the new adaptive discretiration method described in this paper. It performs both discretization and system resolution at each iteration of the shooting process, allowing then interactivity.Item A Progressive Algorithm for Three Point Transport(Blackwell Publishers Ltd and the Eurographics Association, 1999) Dumont, Reynald; Bouatouch, Kadi; Gosselin, PhilippeWhen computing global illumination in environments made up of surfaces with general Bidirectional Reflection Distribution Functions, a three point formulation of the rendering equation can be used. Brute-force algorithms can lead to a linear system of equations whose matrix is cubic, which is expensive in time and space. The hierarchical approach is more efficient. Aupperle et al. proposed a hierarchical three point algorithm to compute global illumination in the presence of glossy reflection. We present in this paper some improvements we brought to this method: shooting, "lazy" push-pull, photometric subdivision criterion, etc. Then we will show how our new method takes into account non-planar surfaces in the hierarchical resolution process.Item Experimenting with a Parallel Ray-Tracing Algorithm on a Hypercube Machine(Eurographics Association, 1988) Priol, Thierry; Bouatouch, KadiA parallel space tracing algorithm is presented. It subdivides the scene into regions. These latter are distributed among the processors of an iPSC hypercube machine designed by Intel company. Each processor subdivides its own region into cells to accelerate the ray tracing algorithm. Processors communicate by means of messages. The pyramidal shape of the regions allows the deletion of the primary ray messages. A method of performing a roughly uniform load distribution is proposed.Item A VLSI Chip for Ray Tracing Bicubic Patches(Eurographics Association, 1989) Bouatouch, Kadi; Saouter, Yannick; Candela, Jean CharlesThis paper deals with the integration of a VLSI chip dedicated to ray tracing bicubic patches. A recursive subdivision algorithm is embedded in this chip. The recursion stops when the termination conditions are met. A software implementation allowed for the determination of key parameters which influenced the choice of the proposed chip' architecture. Only some modules of the chip are, at the present time, simulated and laid out, the rest is being implemented. A detailed description of the chip' modules is given.Item Computation of Higher Order Illumination with a Non-Deterministic Approach(Blackwell Science Ltd and the Eurographics Association, 1996) Bouatouch, Kadi; Pattanaik, S. N.; Zeghers, EricIn spite of the number of efforts made by the computer graphics researchers, till today the computation of view-independent global illumination in an environment containing non-diffusely reflecting objects is a non-resolved problem. In general, non-deterministic techniques seem to be capable of solving this problem. In this article we propose one such non-deterministic method which will permit such calculation by using a combined technique of higher order function approximation and particle tracing. We have used multi-wavelets as basis functions and have calculated the illumination function approximation coefficients by exploiting the adjointness between the radiance equation and the potential equation.Item Theoretical Developments on Polygonal Approximation of Parametric Surfaces for Ray Tracing(Blackwell Publishing Ltd and the Eurographics Association, 1988) Bouatouch, KadiSome theoretical extensions are brought to Koparkar and Mudur s method which deals with a polygonal approximation of parametric surfaces using potential extrema. The proposed extensions allow the determination of both the existence and the equation of a curve solution of potential extrema. Solutions are given to solve the crack problem and to avoid the artificats due to an inexact ray-surface intersection point near the silhouette or on the higher curvature regions. Moreover, two methods of ray tracing surfaces are proposed.Item Low Sampling Densities using a psychovisual approach(Eurographics Association, 1991) Bouville, Christian; Tellier, Pierre; Bouatouch, KadiIt has long been observed that the keenness of sight is lower for diagonal directions than for horizontal or vertical ones. This anisotropy of the human eye response can be exploited by using a non-orthogonal sampling pattern with a reduced sampling density. After an introduction to the two-dimensional sampling theory, it is shown that quincunx sampling is well suited to this characteristic. Then a sampling scheme based on this approach is described. This effectively leads to halving the sampling density and thereby the computing time of ray-traced pictures.Item Synchronisation and Load Balancing for Parallel Hierarchical Radiosity of Complex Scenes on a Heterogeneous Computer Network(Blackwell Publishers Ltd and the Eurographics Association, 1999) Meneveaux, Daniel; Bouatouch, KadiIn this paper we propose a SPMD parallel hierarchical radiosity algorithm relying on a novel partitioning method which may apply to any kind of architectural scene. This algorithm is based on MPI (Message Passing Interface), a communication library which allows the use of either a heterogeneous set of concurrent computers or a parallel computer or both. The database is stored on a common directory and accessed by all the processors (through NFS in case of a network of computers). As the objective is to handle complex scenes such as building interiors, to cope with the problem of memory size, only a subset of the database resides in memory of each processor. This subset is determined with the help of a partitioning into 3D cells, clustering and visibility calculations. A graph expressing visibility between the resulting clusters is determined, partitioned (with a new method based on classification of K-means type) and distributed amongst all the processors. Each processor is responsible for gathering energy (using the Gauss-Seidel method) only for its subset of clusters. In order to reduce the disk transfers due to downloading these subsets of clusters, we use an ordering strategy based on the traveling salesman algorithm. Dynamic load balancing relies on a task stealing approach while termination is detected by configuring the processors into a ring and moving a token around this ring. The parallel iterative resolution is of group iterative type. Its mathematical convergence is proven in the appendix.Item Fast Wavelet Radiosity Method(Blackwell Science Ltd and the Eurographics Association, 1994) Pattanaik, Sumanta N.; Bouatouch, KadiWavelet analysis has been found [1] to be very useful for functional representation and accurate global solution of radiosity. In radiosity we deal with functions in 2D and 4D spaces. Under such conditions, the biggest bottleneck in applying this wavelet analysis seems to be the large number of multidimensional inner products. In this paper, we propose (i) the use of interpolating wavelets for fast inner product computation and consequently for faster wavelet radiosity solution (ii) the use of hierarchical decomposition technique for determining the smoothness of the radiosity function for optimal adaptive subdivision.