Concepts2

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#convex hull
⚙️AlgorithmAdvanced

Voronoi Diagram and Delaunay

Voronoi diagrams partition the plane so each region contains points closest to one site, while the Delaunay triangulation connects sites whose Voronoi cells touch.

#voronoi diagram#delaunay triangulation#fortune algorithm+12
⚙️AlgorithmAdvanced

Minkowski Sum

The Minkowski sum A ⊕ B adds every point of set A to every point of set B, and for convex polygons it can be computed in O(n + m) by merging edge directions.

#minkowski sum#convex polygon#edge merge+12