sep
CS MSc Thesis Presentation 10 September 2026
One Computer Science MSc thesis to be presented on 10 September
Thursday, 10 September there will be a master thesis presentation in Computer Science at Lund University, Faculty of Engineering.
The presentation will take place in E:4130 (Lucas).
Note to potential opponents: Register as an opponent to the presentation of your choice by sending an email to the examiner for that presentation (firstname [dot] lastname [at] cs [dot] lth [dot] se). Do not forget to specify the presentation you register for! Note that the number of opponents may be limited (often to two), so you might be forced to choose another presentation if you register too late. Registrations are individual, just as the oppositions are! More instructions for opponents are found here on the LTH thesis project page.
13:00-14:00 in E:4130 (Lucas)
- Presenter: Petter Sundkvist
- Title: Texture Compression for Spherical Harmonic Lighting
- Examiner: Flavius Gruian
- Supervisors: Michael Doggett (LTH)
To circumnavigate computational limitations when implementing realistic lighting, one might pre-compute more complex light calculations offline, and then use this stored rendering data in real-time. A subset of these implementations involves placing a number of light-probes in a scene, calculating the lighting relative to each probe. One way to store an approximation of the probe-data is with the use of Spherical Harmonic functions, which will yield a series of coefficients. This project studied the possibility of storing these coefficients on a texture, so that the data could further be compressed via applying texture compression. To test this possibility an application was developed for computing the coefficients, writing to a texture and rendering a scene with Spherical Harmonic lighting. After implementation, the lighting using the compressed coefficient textures contained noticeable artifacts in the form of vivid discoloration and changes in brightness.
Om evenemanget
Plats:
E:4130 (Lucas)
Kontakt:
birger [dot] swahn [at] cs [dot] lth [dot] se