avinashselvam

🏠

Working from home

ShareChat. Ola. IIT Madras.

avinashselvam / cellular_noise.glsl

Created November 29, 2025 06:08

Noise Shaders

	#version 300 es

	precision highp float;
	precision highp sampler2D;

	// normalized coordinates, (0,0) is the bottom left
	in vec2 uv;
	// resulting fragment color, you may name it whatever you like
	out vec4 out_color;

avinashselvam / index.html

Created November 28, 2025 19:38

Spinning Boxes Effect

	<!doctype html>
	<html>
	<head>
	<meta charset="utf-8" />
	<meta name="viewport" content="width=device-width,initial-scale=1" />
	<title>Animated White Noise</title>
	<style>
	@property --angle {
	syntax: "<angle>";
	inherits: false;

avinashselvam / index.html

Created November 26, 2025 12:43

Reve Loading Animation

	<!doctype html>
	<html>
	<head>
	<meta charset="utf-8" />
	<meta name="viewport" content="width=device-width,initial-scale=1" />
	<title>Animated White Noise</title>
	<style>
	body {
	overflow: hidden;
	margin: 0;

avinashselvam / Hungarian.py

Last active July 20, 2020 09:45

Hungarian Maximum Matching Algorithm

	class Node:

	"""
	Vertex / Node in a bipartite graph

	Attributes
	----------
	id : int
	Unique identifier within a set
	set: int

avinashselvam / autodiff.py

Created May 9, 2020 12:32

example of forward and backward automatic differentiation on a computational graph

	class Constant():

	def __init__(self, value):
	self.value = value
	self.gradient = None

	def evaluate(self):
	return self.value

	def derivative(self, wrt_variable):

avinashselvam / filter.swift

Created June 19, 2019 11:15

A swift class that implements GPU based image processing

	//
	// filter.swift
	// fltr
	//
	// Created by Avinash on 18/06/19.
	// Copyright © 2019 eightyfive. All rights reserved.
	//

	import Metal
	import MetalKit

avinashselvam / longest_increasing_subsequence.py

Created January 9, 2019 05:10

function to calculate Longest Increasing Subsequence given an array of unsorted integers

avinashselvam / coin_change.py

Created December 30, 2018 18:09

function to calculate coin change recursively using dynamic programming

	n = 10
	c = [2, 3, 5, 6]

	ways = [[0 if i < min(c) else - 1 for i in range(n + 1)] for j in c]

	def num_ways(n, c):
	row = len(c) - 1
	# base case
	if n < min(c): return 0