Concept

Uniform star polyhedron

Related lectures (20)

Explores abstract interpretation in Stainless, demonstrating its application in program verification and discussing future directions for the project.

Shadows: Proper and Cast Shadows in Descriptive Geometry

Covers proper and cast shadows in descriptive geometry with practical examples and exercises.

2D Case: Polynomial Encroaching

Covers the 2D case of polynomial encroaching and vertices of polyhedra.

Faces, Facets and Vertices

Covers the concepts of faces, facets, and vertices in polyhedra, exploring minimal faces and inequalities.

Separating Hyperplanes: Theory and Applications

Explores separating hyperplanes for two sets X and Y, discussing conditions for separation and implications of convexity.

Cellular Approximation Theorem

Focuses on proving the Cellular Approximation Theorem, introducing polyhedra and piecewise linear maps.

Convex Concave Configuration

Demonstrates the process of including beams and correcting orientations for complex configurations.

Basic Solutions and Polyhedra

Explores extreme points, vertices, and basic feasible solutions in polyhedra, emphasizing their properties and construction.

Geometry: Solving Equations and Topological Transformations

Explores solving equations, sketch behavior, and topological transformations in geometry.

Symmetries in Space

Introduces the fundamentals of geometry and explores symmetries in space.

Convex Optimization: Introduction and Sets

Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.

Geometry: Theory of 3 Means of Architas

Explores the theory of 3 means of Architas in Chapter 5.

Convex Polyhedra and Linear Programs

Explores convex polyhedra, linear programs, and their optimization importance.

Harmonic Ratio in Geometry

Explores harmonic ratio in geometry, covering bisectors, harmonic segments, polyhedra, spatial curves, and historical perspectives.

Linear constraints, Feasible directions

Explores feasible directions in optimization algorithms and how to determine them.

Linear and Integer Programming

Covers the theory of linear and integer programming, focusing on the integer hull and rational polyhedra.

Convex Optimization: Epigraphs

Explores epigraphs, convexity of bivariate functions, and log-sum-exp functions in convex optimization.

Polygons & Polyhedra: Regular & Starred

Explores polygons, polyhedra, regularity, and starred configurations in Euclidean geometry, highlighting historical context and limitations.

Symmetry in Geometry

Explores symmetry in modern geometry, emphasizing reflections, rotations, and practical applications in computer-aided design.

Convex Optimization

Covers an overview of convex optimization, affine sets, polyhedra, ellipsoids, and convex functions.