Saifuddin Abdullah saifuddin778

sales-samples

Visual representation of the process of finding convex hull for a set of random 2D points (implementation known as the Gift Wrapping or Jarvis's March algorithm).

Morph vs Grayscale.

Demonstration of how different real-time optimal cost finding approaches can work. This example utilizes d3's element/node caching, which gives a benefit of drastically reducing the element/node lookup time. This way, no application of select() or selectAll() is done to find and filter nodes in the directional vicinity: [(x+k, y), (x, y+k), (x+k, y+k)].

An example of an unsettling, unstable color palette.

Chaining Transitions, on Booboo's idea.

DTW (Dynamic Time Warping) is a widely used algorithm for finding similarity metric between two time-series (T1 and T2). The idea of this algorithm is to utilize dynamic programming to figure out the most optimal alignment path (i.e. a path that minimizes the overall distance cost if we have to travel from beginning to the end of both time-series(s) while comparing them), which is constructed under some constraints.

This demonstration gives a basic idea of how this path is constructed. The original distance value is usually interpreted as the cumulative cost present at i=N, J=M, where N is the size of T1 and M is the size of T2. A very intuitive visible observation is: As the path is constructed, it avoids the traps with higher cost (red-ish).

Troodon with dual perception.

Troodon

SVG's rotation behavior for items.