 | 2009 |
| 25 |  | Jon Hasselgren,
Jacob Munkberg,
Tomas Akenine-Möller:
Automatic pre-tessellation culling.
ACM Trans. Graph. 28(2): (2009) |
| 2008 |
| 24 |  | Petrik Clarberg,
Tomas Akenine-Möller:
Practical Product Importance Sampling for Direct Illumination.
Comput. Graph. Forum 27(2): 681-690 (2008) |
| 23 |  | Petrik Clarberg,
Tomas Akenine-Möller:
Exploiting Visibility Correlation in Direct Illumination.
Comput. Graph. Forum 27(4): 1125-1136 (2008) |
| 22 |  | Jacob Munkberg,
Petrik Clarberg,
Jon Hasselgren,
Tomas Akenine-Möller:
Practical HDR Texture Compression.
Comput. Graph. Forum 27(6): 1664-1676 (2008) |
| 21 |  | Tolga K. Çapin,
Kari Pulli,
Tomas Akenine-Möller:
The State of the Art in Mobile Graphics Research.
IEEE Computer Graphics and Applications 28(4): 74-84 (2008) |
| 2007 |
| 20 |  | Jacob Munkberg,
Ola Olsson,
Jacob Ström,
Tomas Akenine-Möller:
Tight frame normal map compression.
Graphics Hardware 2007: 37-40 |
| 19 |  | Jim Rasmusson,
Jon Hasselgren,
Tomas Akenine-Möller:
Exact and error-bounded approximate color buffer compression and decompression.
Graphics Hardware 2007: 41-48 |
| 18 |  | Tomas Akenine-Möller,
Jacob Munkberg,
Jon Hasselgren:
Stochastic rasterization using time-continuous triangles.
Graphics Hardware 2007: 7-16 |
| 17 |  | Jon Hasselgren,
Tomas Akenine-Möller:
PCU: the programmable culling unit.
ACM Trans. Graph. 26(3): 92 (2007) |
| 2006 |
| 16 |  | Jacob Munkberg,
Petrik Clarberg,
Jon Hasselgren,
Tomas Akenine-Möller:
High dynamic range texture compression for graphics hardware.
ACM Trans. Graph. 25(3): 698-706 (2006) |
| 15 |  | Thomas Larsson,
Tomas Akenine-Möller:
A dynamic bounding volume hierarchy for generalized collision detection.
Computers & Graphics 30(3): 450-459 (2006) |
| 2005 |
| 14 |  | Jacob Ström,
Tomas Akenine-Möller:
iPACKMAN: high-quality, low-complexity texture compression for mobile phones.
Graphics Hardware 2005: 63-70 |
| 13 |  | Manfred Ernst,
Tomas Akenine-Möller,
Henrik Wann Jensen:
Interactive rendering of caustics using interpolated warped volumes.
Graphics Interface 2005: 87-96 |
| 12 |  | Samuli Laine,
Timo Aila,
Ulf Assarsson,
Jaakko Lehtinen,
Tomas Akenine-Möller:
Soft shadow volumes for ray tracing.
ACM Trans. Graph. 24(3): 1156-1165 (2005) |
| 11 |  | Petrik Clarberg,
Wojciech Jarosz,
Tomas Akenine-Möller,
Henrik Wann Jensen:
Wavelet importance sampling: efficiently evaluating products of complex functions.
ACM Trans. Graph. 24(3): 1166-1175 (2005) |
| 10 |  | Anders Wang Kristensen,
Tomas Akenine-Möller,
Henrik Wann Jensen:
Precomputed local radiance transfer for real-time lighting design.
ACM Trans. Graph. 24(3): 1208-1215 (2005) |
| 9 |  | Jon Hasselgren,
Tomas Akenine-Möller,
Samuli Laine:
A Family of Inexpensive Sampling Schemes.
Comput. Graph. Forum 24(4): 843-848 (2005) |
| 2004 |
| 8 |  | Michael D. McCool,
Tomas Akenine-Möller:
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware 2004, Grenoble, France, August 29-30, 2004
Eurographics Association 2004 |
| 7 |  | Timo Aila,
Tomas Akenine-Möller:
A hierarchical shadow volume algorithm.
Graphics Hardware 2004: 15-23 |
| 6 |  | Ulf Assarsson,
Tomas Akenine-Möller:
Occlusion culling and z-fail for soft shadow volume algorithms.
The Visual Computer 20(8-9): 601-612 (2004) |
| 2003 |
| 5 |  | Ulf Assarsson,
Michael Dougherty,
Michael Mounier,
Tomas Akenine-Möller:
An optimized soft shadow volume algorithm with real-time performance.
Graphics Hardware 2003: 33-40 |
| 4 |  | Ulf Assarsson,
Tomas Akenine-Möller:
A geometry-based soft shadow volume algorithm using graphics hardware.
ACM Trans. Graph. 22(3): 511-520 (2003) |
| 3 |  | Tomas Akenine-Möller,
Jacob Ström:
Graphics for the masses: a hardware rasterization architecture for mobile phones.
ACM Trans. Graph. 22(3): 801-808 (2003) |
| 2 |  | Thomas Larsson,
Tomas Akenine-Möller:
Efficient collision detection for models deformed by morphing.
The Visual Computer 19(2-3): 164-174 (2003) |
| 2002 |
| 1 |  | Tomas Akenine-Möller,
Ulf Assarsson:
Approximate Soft Shadows on Arbitrary Surfaces using Penumbra Wedges.
Rendering Techniques 2002: 297-305 |