Interactive display of volumetric data by Fast Fourier Projection

S Dunne1, S Napel, B Rutt

  • 1Department of Computer Science, University of Western Ontario, London, Canada.

Related Concept Videos

Fischer Projections02:18

Fischer Projections

Learning to draw Fischer projections of molecules and understanding their relevance plays a crucial role in the visual depiction of organic molecules. A Fischer projection is a two-dimensional projection on a planar surface to simplify the three-dimensional wedge–dash representation of molecules. This is especially helpful in the case of molecules with multiple chiral centers that can be difficult to draw. Here, all the bonds of interest are represented as horizontal or vertical lines. While...
Velocity and Position by Graphical Method01:34

Velocity and Position by Graphical Method

Velocity and position can be calculated from the known function of acceleration as a function of time. The total area under the acceleration-time graph and the velocity-time graph gives the change in velocity and position, respectively. In the case of an airplane, its acceleration is tracked using the inertial navigation system. The pilot provides the input of the airplane's initial position and velocity before takeoff. The inertial navigation system then uses the acceleration data to calculate...
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Cylinders in Three-Dimensional Space01:28

Cylinders in Three-Dimensional Space

A cylindrical surface is generated when a two-dimensional profile curve is translated along a straight line in three-dimensional space. The translated copies of the curve form a surface composed of parallel rulings, each oriented in the same fixed direction. This construction allows many three-dimensional forms to be described using relatively simple planar equations.In Cartesian coordinates, a cylindrical surface is often recognized by an equation that omits one of the three variables. For...