The tripod packing problem is a simple but extremely challenging problem. It has connections with computational geometry, combinatorial optimization and graph theory. However, despite some progress having been made, it remains largely open. This seminar aims at showing various possible ways this problem can be defined, some of its numerous interesting properties, its present lower and upper bounds and other assorted results concerning it.