Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of simplices in delta complexes, defining a simplex as the convex hull of a set of points not contained in an affine subspace. It explains the standard n-simplex as the hull of a standard basis in R^n, and the ordering of vertices in an ordered n-simplex. The lecture also discusses the boundary of a simplex and the open simplex, providing examples and illustrations.