Final year dual degree student
CSE, IIT-Kharagpur
Built in p5js, press Space or mouse to control the fish. Just like flappy bird, the goal is to swim between columns of pipes without hitting them.
Smart Rockets is a fun little demo of genetic algorithms. A population of rockets attempts to find their way to a target while dodging an obstacle along the way. Their fitness is evaluated by how close they reach to the goal without crashing into the obstacle or any border. Based on a coding challenge by Daniel Shiffman.
Save your block from the other falling blocks in this game. Increase your score and climb up the levels. The falling blocks follow Poisson distributiion to ensure that the occurrence of one falling event does not affect the probability that a second falling event will occur. That is, events occur independently.
An implementation of the EM algorithm from scratch. Estimated density using mixtures of gaussians. You can add points by clicking anywhere on the screen or by clicking on "Add Random Points" which adds a bunch of points. Running the algorithm takes close to 5 seconds, primarily because of calculating the probability density for a large part of the canvas. Run it in a smaller sized window to run it fast.
The convex hull of a (2D or 3D) point set P is the smallest convex set that contains all points of P . For a 2D set P , the convex hull may be visualized as the taut polygon formed by a rubber band stretched around the points of P . Finding the convex hull of a finite set of points is one of the fundamental problems of computational geometry.
Perlin noise is a type of gradient noise used by visual effects artists to increase the appearance of realism in computer graphics. This web page uses a 2D perlin noise distribution to create a force field in which a thousand particles are dropped on the screen and their locus is displayed to create beautiful designs.
This fractal plant uses L-system rules. The recursive nature of the L-system rules leads to self-similarity and thereby, fractal-like forms are easy to describe with an L-system. Plant models and natural-looking organic forms are easy to define, as by increasing the recursion level the form slowly 'grows' and becomes more complex.
The Koch curve is a mathematical curve and one of the earliest fractal curves to have been described. The progression for the area of the curve converges to 8/5 times the area of the original triangle, while the progression for the curve's perimeter diverges to infinity. Consequently, the curve has a finite area bounded by an infinitely long line.
We say that a graph G is a bar visibility graph, and S a bar visibility representation of G, if there exists a one-to-one correspondence between vertices of G and bars in S, such that there is an an edge between two vertices in G iff there exists an unobstructed vertical line of sight between their corresponding bars.
The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.
The maximum submatrix problem is the task of finding the contiguous submatrix within a two-dimensional array of numbers which has the largest sum.
A Voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane. That set of points, called sites, is specified beforehand, and for each site there is a corresponding region consisting of all points closer to that site than to any other. These regions are called the Voronoi cells.
The 15 Puzzle is a sliding puzzle that consists of a 4 by 4 frame of numbered square tiles in an arbitrary ordering with one space. The objective of the puzzle is to place the tiles in order, as shown in the above image, by making sliding moves that use the empty space.
A double pendulum is a pendulum with another pendulum attached to its end, and is a simple physical system that exhibits rich dynamic behaviour with a strong sensitivity to initial conditions. The motion of a double pendulum is governed by a set of coupled ordinary differential equations and is chaotic. This video is a computer simulation in processing about the double pendulum.
We assign to each graph G with vertex set [n] and m edges a probability P(G) = (p^m)*{(1− p)^(nC2 - m)}. Equivalently, we start with an empty graph with vertex set [n] and perform nC2 Bernoulli experiments inserting edges independently with probability p. Such a random graph is called as a binomial random graph.
This is just a cursor following face built using p5-js.
A game in which you have to save yourself from colliding the spooky eye. However to obtain a high score, you need to remain as close as possible to the eye. It is built using p5-js, a JS client-side library for creating graphic and interactive experiences, based on the core principles of Processing.
