ConceptEngineering
Convex hull
The set of all convex combinations of points in a given set.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Convex combination1Convex set1Non-convex set1Points and coordinates1Points in a plane1Polygons1Two-dimensional coordinate systems1
Opens up
Concepts that name this one as a prerequisite.
Bézier curves1Complexity of convex hull merge1Convex envelope1Finite pointwise maximum rule for subgradients1Gamut of perceivable colors1Generalization vs. extrapolation1Gift wrapping algorithm1Merge algorithm1Newton polytope1Piecewise linear minimization optimality1Subset Smoothed polytope K'1Subset smoothing1
Lecturers
3Each in their own terms, from the easiest level.
Erik Demaine & Srini Devadas
An envelope or hull associated with a collection of points on a plane that encloses all of the points.Steve Brunton
The convex hull is the smallest set that is convex that contains a given non-convex set.
Lectures that assume it
10- Convex Optimization Problems — LP, QP, SOCP & SDP
- Color Spaces and Chromaticity (CS 178, Lecture 12)
- Subgradients: Subdifferential Calculus & Optimality Conditions
- Subgradients II: Directional Derivatives, Cutting Planes & Quasiconvexity
- Mixed-discrete (combinatorial) and continuous optimization
- Robust Control & Policy Search
- Algebraic Geometry and Discrete Periodic Operators
- Humanoid Robots
- Imitation Learning, Foundation Models, and Course Wrap-up
- Latent Variable models and Subset Smoothing
Connections
20The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Convex combination
- Convex set
- Bézier curves
- Complexity of convex hull merge
- Convex envelope
- Finite pointwise maximum rule for subgradients
Show 1 moreShow fewer
Lectures13
- Divide & Conquer: Convex Hull, Median Finding
- Convex Sets
- Affine Sets, Convex Sets, Cones & Hyperplanes
- Convex Optimization Problems — LP, QP, SOCP & SDP
- Color Spaces and Chromaticity (CS 178, Lecture 12)
- Subgradients: Subdifferential Calculus & Optimality Conditions
Show 7 moreShow fewer
- Subgradients II: Directional Derivatives, Cutting Planes & Quasiconvexity
- Mixed-discrete (combinatorial) and continuous optimization
- Robust Control & Policy Search
- Algebraic Geometry and Discrete Periodic Operators
- Humanoid Robots
- Imitation Learning, Foundation Models, and Course Wrap-up
- Latent Variable models and Subset Smoothing