🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
🧩Problems🎯Prompts🧠Review
Search

Concepts3

Category

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

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#convex polygon
⚙️AlgorithmAdvanced

Half-Plane Intersection

Half-plane intersection (HPI) computes the common region that satisfies many linear side-of-line constraints in the plane.

#half-plane intersection#computational geometry#convex polygon+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
⚙️AlgorithmIntermediate

Point in Polygon

Point-in-polygon decides whether a point lies outside, inside, or on the boundary of a polygon.

#point in polygon#ray casting#winding number+11