Gist 585271

100%

✓ Published0🌍 Public

Last edited Sep 18, 2010

Created on Sep 18, 2010

This example demonstrates a one-dimensional Gaussian kernel generated by the Ruby class `GThang`, which computes a discrete approximation of the kernel over a radius of three units. It shows the resulting array of kernel values printed to the console via `puts`, highlighting the symmetric, bell-shaped weighting used in kernel density estimation. The code implements the Gaussian function manually using `Math.sqrt`, `Math::PI`, and `Math::E`, with no external visualization libraries or data sources. The output is a simple numeric list, not a graphical plot, so the visualization is limited to the textual representation of the kernel’s weights.

AI-generated description

Similar vizzes

Loading thumbnail…

Kernel Density Estimation

This example visualizes the distribution of wait times between eruptions of the Old Faithful geyser, comparing a histogram of 272 observations from R’s `faithful` dataset with a smooth kernel density estimate. The density curve, computed using an Epanechnikov kernel with a bandwidth of 7, reveals the bimodal nature of the data, with peaks around 55 and 80 minutes. The visualization uses d3.histogram for binning, d3.line with curveBasis for the density path, and d3.axisBottom and d3.axisLeft for the axes, rendering in SVG.

Mmbostock

57% match

Loading thumbnail…

3D Scatter Plot

This example visualizes the Wheat kernel dataset as a 3D scatter plot, displaying Area, Perimeter, and Kernel Length as markers in three-dimensional space. It also includes a second trace that combines Area, Perimeter, and Kernel Width, using distinct colors and marker symbols to differentiate the two series. The visualization is built with Plotly’s `scatter3d` and `scatter2d` types, with data loaded via D3’s `d3.csv` and rendered into a `div` using `Plotly.newPlot`. The layout margins are set to zero for a clean, full-bleed presentation.

Ssuchitra2602

56% match

Loading thumbnail…

Gist 119211

This example visualizes the Mandelbrot set as a fixed ASCII-art plot in a terminal, using Ruby’s `Complex` class to iterate the function `z*z + c` fifty times per point. The code samples a 2D grid over the complex plane—x from -2.0 to 0.5 and y from 1.0 to -1.0—and prints an asterisk when the final magnitude is less than 2, otherwise a space. It shows a symmetric, high-level fractal silhouette rendered entirely with text characters, with no graphical libraries involved. The rendering approach relies on nested `step` loops and `Array.new(50,a).inject` to perform the iteration, producing the classic bulb-and-spiral structure directly in the console output.

DDylanFM

56% match

Loading thumbnail…

Gist 130517

This visualization displays a sparse, grid-based dataset from a gist by DylanFM, using a fixed-size coordinate system (values such as 1056, 64, 1152, and 4608) to plot points in a two-dimensional space. The rendering relies on D3’s `d3.forceSimulation` for positioning and likely `d3.geoPath` or a similar path generator to draw shapes, though the specific API is not explicitly shown. The data, provided as a plain text file, is read and mapped directly to screen coordinates without additional transformation, creating a minimal scatter-like plot. The example emphasizes raw data plotting with minimal abstraction, focusing on the direct conversion of numeric inputs into visual marks.

DDylanFM

56% match

Loading thumbnail…

Kernel Smoothing

This example visualizes kernel smoothing by plotting raw count data over time as small, semi-transparent steel-blue symbols, then overlaying a smooth black trend line that averages nearby values with an Epanechnikov kernel. The data, loaded from a CSV file, is parsed with `d3.utcParse` and drawn to a Canvas context. The custom smoothing curve is implemented via `d3.line` with a `kernelSmooth` curve factory, which computes weighted averages over a specified bandwidth. The visualization uses D3 v4 for scaling and plotting, and the result is a clear comparison between the noisy observations and the smoothed pattern.

Mmbostock

55% match

Loading thumbnail…

Gist 23733

This example visualizes the distinction between local variables, instance variables, and block scoping in Ruby through a sequence of short code snippets. It shows how assignment semantics affect values across method calls and blocks, culminating in a Numeric class monkey-patch. The visualization likely renders each snippet as annotated code blocks with output values, using a custom layout or a library like D3.js to arrange the snippets and highlight variable bindings. The data originates from the gist’s source code, presented without external datasets, focusing on the logic of variable scope rather than numerical or spatial data.

DDylanFM

54% match

Loading thumbnail…

Untitled

This example visualizes the distribution of probability estimates from eight verbal uncertainty phrases (such as “Almost Certainly” and “Almost No Chance”) using kernel density estimation. Each smoothed density curve is colored with a viridis scale based on the group mean, revealing differences in central tendency and spread across categories. The visualization uses D3 v4 to load CSV data from GitHub, compute the means, and render the densities as SVG paths. The kernel density estimator applies an Epanechnikov kernel, while axes, gridlines, and labels are drawn with `d3.axisBottom`, `d3.axisLeft`, and the `d3.scaleSequential` with `d3.interpolateViridis`.

SSimone

54% match

Loading thumbnail…

Gaussian Primes - MrWatson after Jason Davies

This visualization plots Gaussian primes as filled squares on the complex plane, with the pattern emerging across a grid of integers. It uses d3.v5 to render the SVG elements, with a custom `isGaussianPrime` function that checks the criteria for primes on the axes and in the interior. The code generates points by iterating over a symmetric range and applies a static rendering, with a circular clipping mask defining the visible area. The implementation follows Jason Davies’ original approach, though the developer notes that a cached prime-checking function underperforms the simpler dynamic version.

RRussell Watson

54% match