Differentiable vector graphics rasterization for editing and learning
We introduce a differentiable rasterizer that bridges the vector graphics and raster image
domains, enabling powerful raster-based loss functions, optimization procedures, and …
domains, enabling powerful raster-based loss functions, optimization procedures, and …
Embree: a kernel framework for efficient CPU ray tracing
We describe Embree, an open source ray tracing framework for x86 CPUs. Embree is
explicitly designed to achieve high performance in professional rendering environments in …
explicitly designed to achieve high performance in professional rendering environments in …
Optix: a general purpose ray tracing engine
SG Parker, J Bigler, A Dietrich, H Friedrich… - Acm transactions on …, 2010 - dl.acm.org
The NVIDIA® OptiX™ ray tracing engine is a programmable system designed for NVIDIA
GPUs and other highly parallel architectures. The OptiX engine builds on the key …
GPUs and other highly parallel architectures. The OptiX engine builds on the key …
Toward real-time ray tracing: A survey on hardware acceleration and microarchitecture techniques
Ray tracing has long been considered as the next-generation technology for graphics
rendering. Recently, there has been strong momentum to adopt ray tracing--based …
rendering. Recently, there has been strong momentum to adopt ray tracing--based …
A survey on bounding volume hierarchies for ray tracing
Ray tracing is an inherent part of photorealistic image synthesis algorithms. The problem of
ray tracing is to find the nearest intersection with a given ray and scene. Although this …
ray tracing is to find the nearest intersection with a given ray and scene. Although this …
Designing efficient sorting algorithms for manycore GPUs
We describe the design of high-performance parallel radix sort and merge sort routines for
manycore GPUs, taking advantage of the full programmability offered by CUDA. Our radix …
manycore GPUs, taking advantage of the full programmability offered by CUDA. Our radix …
[PDF][PDF] Maximizing parallelism in the construction of BVHs, octrees, and k-d trees
T Karras - Proceedings of the Fourth ACM SIGGRAPH …, 2012 - diglib.eg.org
A number of methods for constructing bounding volume hierarchies and point-based octrees
on the GPU are based on the idea of ordering primitives along a space-filling curve. A major …
on the GPU are based on the idea of ordering primitives along a space-filling curve. A major …
An effective GPU implementation of breadth-first search
Breadth-first search (BFS) has wide applications in electronic design automation (EDA) as
well as in other fields. Researchers have tried to accelerate BFS on the GPU, but the two …
well as in other fields. Researchers have tried to accelerate BFS on the GPU, but the two …
Data-parallel hashing techniques for GPU architectures
Hash tables are a fundamental data structure for effectively storing and accessing sparse
data, with widespread usage in domains ranging from computer graphics to machine …
data, with widespread usage in domains ranging from computer graphics to machine …
Collision and proximity queries
In a geometric context, a collision or proximity query reports information about the relative
configuration or placement of two objects. Some of the common examples of such queries …
configuration or placement of two objects. Some of the common examples of such queries …