Graham Scan is a fast and elegant algorithm for finding the convex hull of a set of points. In this tutorial, we explain the method in simple terms, show how left and right turns work, give pseudocode, and provide a Python implementation. 1. Main idea Imagine many points placed on a sheet. You want to

Jarvis March, also called the Gift Wrapping algorithm, is a simple way to find the convex hull of a set of points. In this tutorial, we explain the idea in layman terms, show how the orientation test works, provide pseudocode, and build a small animation and Python implementation. 1. Main idea in simple words Imagine

1. Idea in simple words Imagine many nails hammered into a board.Now stretch a rubber band around all of them. The shape made by the rubber band is called the convex hull. The slow brute force method tries to find which point pairs form the outer boundary. Main thought Take every pair of points and

1. The Problem — Plain English Imagine dropping several cardboard boxes on the floor. Some overlap, some do not. How much floor is actually covered? That’s the Rectangle Union problem. Given N rectangles (some overlapping), find the total area of their union — counting overlapping regions only once. The naive answer — just add up

Computational Geometry · Sweep Line · Intersection Detection 1. What Is the Line Sweep Algorithm? Imagine you are standing at the far left of a city map, holding a giant transparent ruler perfectly upright — from top to bottom. Now slowly walk to the right, dragging that ruler across the entire map. As you walk,