#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2010

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jacopo Pantaleoni
- High Performance Graphics
- 2011

We present a highly flexible and efficient software pipeline for programmable triangle voxelization. The pipeline, entirely written in CUDA, supports both fully conservative and thin voxelizations, multiple boolean, floating point, vector-typed render targets, user-defined vertex and fragment shaders, and a bucketing mode which can be used to generate 3D… (More)

- Jacopo Pantaleoni, David P. Luebke
- High Performance Graphics
- 2010

We present HLBVH and SAH-optimized HLBVH, two high performance BVH construction algorithms targeting real-time ray tracing of dynamic geometry. HLBVH provides a novel hierarchical formulation of the LBVH algorithm [LGS*09] and SAH-optimized HLBVH uses a new combination of HLBVH and the greedy surface area heuristic algorithm. These algorithms minimize work… (More)

- Kirill Garanzha, Jacopo Pantaleoni, David K. McAllister
- High Performance Graphics
- 2011

A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tracing in real-time, even in the presence of millions of fully dynamic triangles. In this work we present a simpler and faster variant of HLBVH, where all the complex book-keeping… (More)

- Jacopo Pantaleoni, Luca Fascione, Martin Hill, Timo Aila
- ACM Trans. Graph.
- 2010

We describe the architecture of a novel system for precomputing sparse directional occlusion caches. These caches are used for accelerating a fast cinematic lighting pipeline that works in the spherical harmonics domain. The system was used as a primary lighting technology in the movie Avatar, and is able to efficiently handle massive scenes of… (More)

- Toshiya Hachisuka, Jacopo Pantaleoni, Henrik Wann Jensen
- ACM Trans. Graph.
- 2012

We present a new sampling space for light transport paths that makes it possible to describe Monte Carlo path integration and photon density estimation in the same framework. A key contribution of our paper is the introduction of vertex perturbations, which extends the space of paths with loosely coupled connections. The new framework enables the… (More)

- Jacopo Pantaleoni
- ACM Trans. Graph.
- 2017

In this manuscript, inspired by a simpler reformulation of primary sample space Metropolis light transport, we derive a novel family of general Markov chain Monte Carlo algorithms called <i>charted Metropolis-Hastings</i>, that introduces the notion of <i>sampling charts</i> to extend a given sampling domain and make it easier to sample the desired target… (More)

- Jacopo Pantaleoni
- ArXiv
- 2014

We present a new scalable, lightweight algorithm to incre-mentally construct the BWT and FM-index of large string sets such as those produced by Next Generation Sequenc-ing. The algorithm is designed for massive parallelism and can effectively exploit the combination of low capacity high-bandwidth memory and slower external system memory typical of GPU… (More)

- Jacopo Pantaleoni, Eric Heitz
- ArXiv
- 2017

In this manuscript, we derive optimal conditions for building function approximations that minimize variance when used as importance sampling estimators for Monte Carlo integration problems. Particularly, we study the problem of finding the optimal projection g of an integrand f onto certain classes of piecewise constant functions, in order to minimize the… (More)

- ‹
- 1
- ›