• Aucun résultat trouvé

Fast Scene Voxelization Revisited

N/A
N/A
Protected

Academic year: 2021

Partager "Fast Scene Voxelization Revisited"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: inria-00510222

https://hal.inria.fr/inria-00510222

Submitted on 13 Oct 2010

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Fast Scene Voxelization Revisited

Elmar Eisemann, Xavier Décoret

To cite this version:

Elmar Eisemann, Xavier Décoret. Fast Scene Voxelization Revisited. Siggraph technical sketch:

SIGGRAPH’2006, 2006, Boston, United States. �inria-00510222�

(2)

Fast Scene Voxelization and Applications

Elmar Eisemann

ARTIS-GRAVIR/IMAG-INRIA / ENS

Xavier D´ecoret § ARTIS-GRAVIR/IMAG-INRIA

Figure 1: Slicemaps (small figures), can be used for several applications and a variety of effects. Distance is encoded in color, what leads to an efficient voxel representation of the scene. Transmittance shadow maps use this information to attenuate light passing through semi- transparent surfaces (shadows of the trees). We also show that the obtained volume estimation can be used for refraction (lion).

Abstract

This sketch paper presents an overview of ”Fast Scene Voxelization and Applications” published at the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games. It introduces slicemaps that correspond to a GPU friendly voxel representation of a scene.

This voxelization is done at run-time in the order of milliseconds, even for complex and dynamic scenes containing more than 1M polygons. Creation and storage is performed on the graphics card avoiding unnecessary data transfer. Regular but also deformed grids are possible, in particular to better fit the scene geometry. Several applications are demonstrated: shadow calculation, refraction si- mulation and shadow volume culling/clamping.

1 Method

Voxelizing a scene means testing geometry for intersection with an englobing grid of cells. Our approach accomplishes this task effi- ciently with graphics hardware. Instead of interpreting RGBA as 4 unsigned byte values, we will consider it as a 32 bit vector, which itself corresponds to a 32 cell column in the voxelization. An image is thus nothing but a voxel grid, in which each cell is represented by one bit. We call this representation slicemap. The implementa- tion is simple and allows the voxelization of millions of polygons in real-time. In the future, when 32 bit logical operations become available, 4 MRT

1

×4 channels × 32 bits = 512 slices are obtained in a single pass. Our approach shows several similarities to the work by Dong et al.[Dong et al. 2004], who also store depth in bits.

Some major differences exist. First we do not fuse several views (which reduces cracks, but limits resolution). Second voxel grids usually contain axis-aligned cubes, whereas our approach offers se- veral ways to deform the grid (e.g. improving precision by local refinement based on two depth masks containing the furthest and closest fragment for each pixel). We also present a fast technique

e-mail: Elmar.Eisemann@inrialpes.fr

ARTIS is a team of the GRAVIR/IMAG laboratory, a joint effort of CNRS, INRIA, INPG and UJF

Ecole Normale Sup´erieure Paris ´

§

e-mail:Xavier.Decoret@inrialpes.fr

1

Multiple Render Targets

to obtain a filled voxelization without iterative flood fill operations and present all-new applications.

2 Applications

Transmittance Shadow Maps: Illumination is attenuated based on the number of blockers traversed by each light ray before impinging on the surface. This calculation can be performed quickly due to the way we represent voxels and leads to convincing effects for complicated objects like trees or hair at low cost.

Shadow Volume Culling and Clamping: Slicemaps offer the pos- sibility to cull and clamp shadow volumes [Lloyd et al. 2004]. The aforementioned possibility to deform the voxel grid is key here.

Refraction: Given a watertight object, we obtain a filled voxel re- presentation avoiding flood fill. We estimate the object’s volume and use it for refraction and scattering effects.

3 Conclusion

The paper presents a GPU adapted voxel representation, applicable to any rasterizable object providing depth. The presented applica- tions are not straightforward and present contributions on their own.

Local refinement combines the advantage of exact shape informa- tion and approximated volume and results in a good overall estima- tion. Error analysis and conservativity remain future research.

References

D

ONG

, Z., C

HEN

, W., B

AO

, H., Z

HANG

, H.,

AND

P

ENG

, Q.

2004. Real-time voxelization for complex models. In Proceed- ings of the 12th Pacific Conference on Computer Graphics and Applications, 43–50.

L

LOYD

, B., W

ENDT

, J., G

OVINDARAJU

, N. K.,

AND

M

ANOCHA

, D. 2004. Cc shadow volumes. In Proceedings

of the 2nd EG Symposium on Rendering, Eurographics Associa-

tion, Springer Computer Science, Eurographics.

Références

Documents relatifs

Figure 5: Overview of the transmittance shadow map algorithm - here with 24 slices stored in RGB channels of 8 bits (cf. color plate AI) Section 3.3 will describe how they can be

If we take Cuda-SGM as the model-based module and an instance of Dil-Net as the data-based one, we can reach rates of around 125 Hz for the estimation of refined disparity maps (3.5

These methods use this approach to integrate a set of features extracted from 2D views of the 3D objects using the SIFT (Scale Invariant Feature Transform [6])

Considering again the process model of Figure 1.a and trace σ = ABCAD- CBACDACABCADCBACADE, we have a loop structure l consisting of: as the forward path, activities A, B and D that

Grid Mind (Rosecky 2015) is a modeling and discrete-event simulation tool built in SWI Prolog, primarily aimed at analyzing the behavior of a particular smart-grid information

iterative refinement, GMRES, linear system, mixed precision, multiple precision, rounding error analysis, floating-point arithmetic, backward error, forward error, preconditioning..

Observing the CSS map and the colorful skyline over different scales for two different landscapes (urban and natural), we can conclude that this descriptor was useful for tracking

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des