Breath-First Search using Stack
1. BFS using Queue Just in the prior post on graph traversal, we went into details of Depth-First Search (DFS) and Breadth-First Search (BFS). BFS is a way of traversing down the graph, level-by-...
Graph Theory: Search and Traversal
0. Graph Traversal Breadth-First Search (BFS) and Depth-First Search (DFS) are two of the most commonly used graph traversal methods. The traversal of a graph, whether BFS or DFS, involves two ma...
Graph Theory: Introduction
Before heading into details of how we store, represent, and traverse various kinds of graphs, this post is more of a ramp-up to better understand what graphs are and the different kinds from a co...
B Trees and B+ Trees
0. Foundation Disk Structure Let's start with disk structure. It's a platter with concentric circles, which are logical not physical. These circles of different radii are called tracks, ...
Google Summer of Code - Cartograms in Grapher
Wish me Luck :) Update: I got the gig 😋 A proposal I submitted for Google Summer of Code, Summer 2022 to Our World in Data (OWID) to implement a population-scaled, shape preserved world cartogr...
Anomaly Detection and Remediation
Expect the Unexpected 1. Introduction The overview of the post is on building a system to detect potential anomalies and take immediate action(s). Hence primarily has two phases: Detect and Cont...
Hybrid Spatial Index: Quad-KD and R-KD trees
Quad-KD vs R-KD trees 1. Abstract A hybrid spatial index is a data structure that combines two or more data structures suitable for effectively storing spatial objects to improve search performa...
Floating Point Round Off Errors in Geometric Algorithms
Eat Spinach and Build your Convex Hull — Popeye the Sailor. Floating Point Precision in Geometric Algorithms Most geometric algorithms are designed for exact real arithmetic; replacing them with...
Custom domain for GitHub pages
Let's get the website up! — Drama llama. Configuration Domain (example.com). Subdomain (www.example.com). HTTPS (Optional but strongly recommended). At the end of the tutorial, you’...
Hybrid Spatial Data Structures: Introduction
Let’s grow the trees! — Totoro. What’s a Spatial Index? A spatial index is a data structure that allows for accessing a spatial object efficiently, which is a commonly used technique in spatial ...
External Merge Sort using Priority Queue
External Sorting — Totoro. External sorting is a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted does not fit into the...