#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1989

2017

- This year (2)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- W W Lockwood, C Friedman, N Bus, C Pierson, R Gaynes
- The American review of respiratory disease
- 1989

We investigated an increase in the number of patient specimens yielding Mycobacterium terrae in 1986, isolation of M. terrae was associated with specimens obtained from inpatients at our new hospital, but not with specimens referred from other hospitals [37(+)/144 inpatient specimens versus 2(+)/26 referred specimens, p less than 0.05]. By October 31, 1987,… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- STACS
- 2015

Over the past several decades there has been steady progress towards the goal of polynomial-time approximation schemes (PTAS) for fundamental geometric combinatorial optimization problems. A foremost example is the geometric hitting set problem: given a set P of points and a set D of geometric objects, compute the minimum-sized subset of P that hits all… (More)

- Norbert Bus, Nabil H. Mustafa, Saurabh Ray
- ESA
- 2015

The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a small-sized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [6] made an important connection of this problem to the size of fundamental… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- Discrete & Computational Geometry
- 2017

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- Comput. Geom.
- 2016

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- ArXiv
- 2015

The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a smallsized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [5] made an important connection of this problem to the size of fundamental… (More)

- Norbert Bus, Nabil H. Mustafa, Venceslas Biri
- Comput. Graph. Forum
- 2015

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… (More)

- Norbert Bus, Nabil H. Mustafa, Venceslas Biri
- Comput. Graph. Forum
- 2015

Instant radiosity methods rely on using a large number of virtual point lights (VPLs) to approximate global illumination. Efficiency considerations require grouping the VPLs into a small number of clusters that are treated as individual lights with respect to each point to be shaded. Two examples of clustering algorithms are Lightcuts [WFA∗05] and… (More)

- Norbert Bus, Tamy Boubekeur
- SIGGRAPH '17
- 2017

We propose a novel representation of the light field tailored to improve importance sampling for Monte Carlo rendering. The domain of the light field i.e., the product space of spatial positions and directions is hierarchically subdivided into subsets on which local models characterize the light transport.The data structure is based on <i>double trees,</i>… (More)

- ‹
- 1
- ›