Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Slabs: Design and Pre-dimensioning

In course

CIVIL-123: Structures II

Le cours permet de comprendre le fonctionnement, déterminer les efforts et de dimensionner les structures en treillis, en poutre, en dalle et en cadre. Le cours se base sur la résolution des efforts par la statique graphique. ...

Description

This lecture covers the pre-dimensioning and graphical representation of slabs supported by beams and columns. Topics include determining equivalent spans, slab thickness, geometry, and load considerations. The instructor also discusses the stability of slab systems.

Instructor

Olivier Burdet

Born 1960, Olivier Burdet has received his Diploma in Civil Engineering from EPFL in 1983. After a couple years in engineering practice, he went back to studying at the university of Texas at Austin, where he received his PhD in 1990. Returning to EPFL in 1990, he is now a senior researcher and a lecturer in the field of reinforced concrete structures. He is also actively involved in the development of internet-based course contents and MOOCs.

Official source

Related concepts (19)

Minimum spanning tree

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components.

Spanning tree

In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (see about spanning forests below). If all of the edges of G are also edges of a spanning tree T of G, then G is a tree and is identical to T (that is, a tree has a unique spanning tree and it is itself).

Euclidean minimum spanning tree

A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system of line segments with the points as endpoints, minimizing the total length of the segments. In it, any two points can reach each other along a path through the line segments. It can be found as the minimum spanning tree of a complete graph with the points as vertices and the Euclidean distances between points as edge weights.

Concrete slab

A concrete slab is a common structural element of modern buildings, consisting of a flat, horizontal surface made of cast concrete. Steel-reinforced slabs, typically between 100 and 500 mm thick, are most often used to construct floors and ceilings, while thinner mud slabs may be used for exterior paving . In many domestic and industrial buildings, a thick concrete slab supported on foundations or directly on the subsoil, is used to construct the ground floor. These slabs are generally classified as ground-bearing or suspended.

Shallow foundation

A shallow foundation is a type of building foundation that transfers structural load to the earth very near to the surface, rather than to a subsurface layer or a range of depths, as does a deep foundation. Customarily, a shallow foundation is considered as such when the width of the entire foundation is greater than its depth. In comparison to deep foundations, shallow foundations are less technical, thus making them more economical and the most widely used for relatively light structures.

Related lectures (1)

Dalle Structures: Concentration and Solutions