aka Some Strategies For Fast Lexical Analysis when Parsing Programming Languages, by Sean Barrett

Details how to add a shunting yard parser into a recursive descent parser. Examples in Python.

"It's not necessary to be familiar with the other algorithms for expression parsing in order to understand precedence climbing. In fact, I think that precedence climbing is the simplest of them all. To explain it, I want to first present what the algorithm is trying to achieve. After this, I will explain how it does this, and finally will present a fully functional implementation in Python."

"The third article describes a method that combines RD [recursive descent] parsing with a different algorithm for parsing expressions to achieve better results. This method is actually used in the real-world, for example in GCC and Parrot (source). An alternative parsing algorithm was discovered by Vaughan Pratt in 1973. Called Top Down Operator Precedence, it shares some features with the modified RD parser, but promises to simplify the code, as well as provide better performance."

Details the Recursive Descent, Shunting Yard and Precedence Climbing parsing algorithms.

Testing whether a point is inside a polygon is a basic operation in computer graphics. Graphics Gems presents an algorithm for testing points against convex polygons (Badouel 1990). This Gem provides algorithms which are from 1.6 to 9 or more times faster for convex polygons. It also presents algorithms for testing non-convex polygons and discusses the advantages and drawbacks of each. Faster, more memory intensive algorithms are also presented, along with an O(log n) algorithm for convex polygons. Code is included for the algorithms discussed.

Describes in depth the history and inner working of the Zip compression format.

Improve ray-tracing performance by building a Bounding Volume Hierarchy using the Surface Area Heuristic as the splitting criterion. "The SAH rewards small nodes with many triangles, while avoiding large nodes with few triangles."

How to efficiently store and access properties of Unicode characters. The technique extends to other problems where sparse or repeating data must be looked up in O(1) time.

Visual explanations of math and algorithms, using motivating examples from computer games.

Review of the math, physics, and coding for springs and dampers.

Details how to add a shunting yard parser into a recursive descent parser. Examples in Python.

"It's not necessary to be familiar with the other algorithms for expression parsing in order to understand precedence climbing. In fact, I think that precedence climbing is the simplest of them all. To explain it, I want to first present what the algorithm is trying to achieve. After this, I will explain how it does this, and finally will present a fully functional implementation in Python."

"The third article describes a method that combines RD [recursive descent] parsing with a different algorithm for parsing expressions to achieve better results. This method is actually used in the real-world, for example in GCC and Parrot (source). An alternative parsing algorithm was discovered by Vaughan Pratt in 1973. Called Top Down Operator Precedence, it shares some features with the modified RD parser, but promises to simplify the code, as well as provide better performance."

Description of Voroni diagrams, Jump Flooding Algorithm (JFA), and rendering them on GPU. Several ShaderToy links with examples.

Basic explanation of Markov chains with interactive visualizations.

Improve ray-tracing performance by building a Bounding Volume Hierarchy using the Surface Area Heuristic as the splitting criterion. "The SAH rewards small nodes with many triangles, while avoiding large nodes with few triangles."

Classic text on programming by Niklaus Wirth

A complete taxonomy of plane-filling (a.k.a space-filling) curves. E.g. Hilbert curve, Peano curve, Morton curve, etc...

A complete taxonomy of plane-filling (a.k.a space-filling) curves. E.g. Hilbert curve, Peano curve, Morton curve, etc...

Describes a range of techniques for approximating/optimizing elementary math functions.

Introduction and deep dive on SIMD/vectorizing code for C++ developers.

With a classical unidirectional path tracer, we'll have some scenes where it is difficult to connect to the light source, and therefore many of our computed samples will be wasted. What if we would start not only one light path from the camera, but one also from the light source, and connect the two together? It turns out that we get a much more robust technique that can render a variety of "packed" scenes with lots of occlusions with ease.

Computing global illumination using the many-lights approach is expensive, this algorithm presents a method ("exploration") for reducing the amount of lights to be sampled.

Metropolis Light Transport is a powerful technique that can outperform the convergence speed of Bidirectional Path Tracing on most difficult scenes (what makes a scene difficult is a story on its own). It promises optimal importance sampling "along multiple steps" in the stationary distribution of the Markov chain.

Describes the Photon Mapping solution to light transport.

Papers describing methods of creating a polygonal representation of a scalar field (e.g. marching cubes with voxels).

A solution to the global illumination problem by sampling from many lights. Stochastic Lightcuts is an improvement on the earlier Lightcuts algorithm. Presentation at HPG 2019.

Describes improvements to Photon Mapping, called Progressive Photon Mapping, Stochastic Photon Mapping, and their combination.

In this Youtube video, the "top down operator precedence" method of parsing is discussed. In a nutshell, TDOP, also known as "Pratt parsing" is sort of like a combination of precedence climbing parsers and recursive descent parsers. Notably TDOP does not use a grammar, which makes it somewhat unique among other parser techniques. A working example by the author can be found here: https://github.com/douglascrockford/TDOP

This page introduces a compact and efficient implementation of Bresenham's algorithm to plot lines, circles, ellipses and Bézier curves.

A complete taxonomy of plane-filling (a.k.a space-filling) curves. E.g. Hilbert curve, Peano curve, Morton curve, etc...

Concise and visually appealing lectures on data structures by Rob Edwards

A course on photorealistic rendering, ray tracing and global illumination at the TU Wien. The entire course is now available here on YouTube!

Photon mapping provides a practical way of efficiently simulating global illumination including interreflections, caustics, color bleeding, participating media and subsurface scattering in scenes with complicated geometry and advanced material models. This class will provide the insight necessary to efficiently implement and use photon mapping to simulate global illumination in complex scenes. The presentation will briefly cover the fundamentals of photon mapping including efficient techniques and datastructures for managing large numbers of rays and photons. In addition, we will describe how to integrate the information from the photon maps in shading algorithms to render global illumination.

With a classical unidirectional path tracer, we'll have some scenes where it is difficult to connect to the light source, and therefore many of our computed samples will be wasted. What if we would start not only one light path from the camera, but one also from the light source, and connect the two together? It turns out that we get a much more robust technique that can render a variety of "packed" scenes with lots of occlusions with ease.

In this Youtube video, the "top down operator precedence" method of parsing is discussed. In a nutshell, TDOP, also known as "Pratt parsing" is sort of like a combination of precedence climbing parsers and recursive descent parsers. Notably TDOP does not use a grammar, which makes it somewhat unique among other parser techniques. A working example by the author can be found here: https://github.com/douglascrockford/TDOP

Computing global illumination using the many-lights approach is expensive, this algorithm presents a method ("exploration") for reducing the amount of lights to be sampled.

Metropolis Light Transport is a powerful technique that can outperform the convergence speed of Bidirectional Path Tracing on most difficult scenes (what makes a scene difficult is a story on its own). It promises optimal importance sampling "along multiple steps" in the stationary distribution of the Markov chain.

A description of Path Tracing, a ray tracing solution to the rendering equation, and one of its traditional optimizations, Next Event Estimation.

Describes the Photon Mapping solution to light transport.

Lighting usually only changes smoothly over a surface, Irradiance Caching is a classic approach to reduce the computational cost by only computing lighting at points where it changes quickly.

Lecture describing how to solve the radiosity equations used to compuse diffuse global illumination.

[...] how to combine glossy reflection ray tracing with diffuse ray-traced irradiance field probes. This creates a complete dynamic global illumination solution that scales across all DXR GPUs and minimizes light leaking without requiring manual per-probe or lightmap work by artists.

A solution to the global illumination problem by sampling from many lights. Stochastic Lightcuts is an improvement on the earlier Lightcuts algorithm. Presentation at HPG 2019.

Describes improvements to Photon Mapping, called Progressive Photon Mapping, Stochastic Photon Mapping, and their combination.