It feels good to be back, reflecting, pondering, and putting thoughts into words. Let's talk about something core to the software engineering that often gets overlooked in the rush to code: des...

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-le...

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 main...

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 comp...

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, an...

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...

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...

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 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...