Norbert Bus

You will be redirected to my new website in a few seconds.

To access the old (not maintained) website click cancel.

This page is outdated. Please visit my new website.

Norbert Bus

PhD student in computer science

I have obtained my MSc degree in Mathematics at Budapest University of Technology and Economics. I am in the 3rd year of my PhD at Université Paris-Est which is focused on the application of data structures and algorithms from computational geometry to various problems (mainly in computer graphics). As the end of my PhD is quickly approching, I am searching for a new research oriented position. I am interested in vision problems as well, however I have not worked on them recently.

You can find my CV here.

Address

Room 5305
Département Informatique, ESIEE Paris
2, Boulevard Blaise Pascal - Cité Descartes, B.P.99,
93126 Noisy-Le-Grand Cedex, France

Email

Publications

Geometric Hitting Sets for Disks: Theory and Practice (Norbert Bus, Nabil H. Mustafa, Saurabh Ray) ESA 2015.
IlluminationCut (Norbert Bus, Nabil H. Mustafa, Venceslas Biri) EUROGRAPHICS 2015.
Improved Local Search for Geometric Hitting Set Problems (Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray) STACS 2015.
Global Illumination Using Well-Separated Pair Decomposition (Norbert Bus, Nabil H. Mustafa, Venceslas Biri) Computer Graphics Forum, to appear 2015.
Dynamic Convex Hull for Simple Polygonal Chains in Constant Amortized Time per Update (Norbert Bus, Lilian Buzer) EuroCG 2015.
Practical and Efficient Algorithms for the Geometric Hitting Set Problem (Norbert Bus, Nabil H. Mustafa, Saurabh Ray) In preparation.
Tighter Estimates for epsilon-nets for Disks (Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray) ArXiv 2014.

IlluminationCut

Abstract

We present a novel algorithm, IlluminationCut, for rendering images using the many-lights framework. It handles any light source that can be approximated with virtual point lights (VPLs) as well as highly glossy materials. The algorithm extends the Multidimensional Lightcuts technique by effectively creating an illumination-aware clustering of the product-space of the set of points to be shaded and the set of VPLs. Additionally, the number of visibility queries for each product-space cluster is reduced by using an adaptive sampling technique. Our framework is flexible and achieves around 3-6 times speedup over previous state-of-the-art methods.

Additional resources

Paper
Supplemental material
Source code
BibTex