 | 2008 |
| 15 |  | Elmar Eisemann,
Xavier Décoret:
Single-pass GPU solid voxelization for real-time applications.
Graphics Interface 2008: 73-80 |
| 14 |  | Thierry Stein,
Xavier Décoret:
Dynamic label placement for improved interactive exploration.
NPAR 2008: 15-21 |
| 13 |  | Hedlena Bezerra,
Elmar Eisemann,
Xavier Décoret,
Joëlle Thollot:
3D dynamic grouping for guided stylization.
NPAR 2008: 89-95 |
| 12 |  | Elmar Eisemann,
Xavier Décoret:
Occlusion Textures for Plausible Soft Shadows*.
Comput. Graph. Forum 27(1): 13-23 (2008) |
| 2007 |
| 11 |  | Elmar Eisemann,
Xavier Décoret:
On Exact Error Bounds for View-Dependent Simplification.
Comput. Graph. Forum 26(2): 202-213 (2007) |
| 10 |  | Elmar Eisemann,
Xavier Décoret:
Visibility Sampling on GPU and Applications.
Comput. Graph. Forum 26(3): 535-544 (2007) |
| 2006 |
| 9 |  | Lionel Baboud,
Xavier Décoret:
Rendering geometry with relief textures.
Graphics Interface 2006: 195-201 |
| 8 |  | Elmar Eisemann,
Xavier Décoret:
Fast scene voxelization and applications.
SI3D 2006: 71-78 |
| 7 |  | Elmar Eisemann,
Xavier Décoret:
Plausible Image Based Soft Shadows Using Occlusion Textures.
SIBGRAPI 2006: 155-162 |
| 2005 |
| 6 |  | Xavier Décoret:
N-Buffers for efficient depth map query.
Comput. Graph. Forum 24(3): 393-400 (2005) |
| 2003 |
| 5 |  | Xavier Décoret,
Gilles Debunne,
François X. Sillion:
Erosion Based Visibility Preprocessing.
Rendering Techniques 2003: 281-288 |
| 4 |  | Xavier Décoret,
Frédo Durand,
François X. Sillion:
Billboard clouds.
Symposium on Computational Geometry 2003: 376 |
| 3 |  | Xavier Décoret,
Frédo Durand,
François X. Sillion,
Julie Dorsey:
Billboard clouds for extreme model simplification.
ACM Trans. Graph. 22(3): 689-696 (2003) |
| 2000 |
| 2 |  | Gernot Schaufler,
Julie Dorsey,
Xavier Décoret,
François X. Sillion:
Conservative volumetric visibility with occluder fusion.
SIGGRAPH 2000: 229-238 |
| 1999 |
| 1 |  | Xavier Décoret,
François X. Sillion,
Gernot Schaufler,
Julie Dorsey:
Multi-layered impostors for accelerated rendering.
Comput. Graph. Forum 18(3): 61-73 (1999) |