diff --git a/include/Nazara/Math/Frustum.hpp b/include/Nazara/Math/Frustum.hpp
index ec272d5fe..cd4be1780 100644
--- a/include/Nazara/Math/Frustum.hpp
+++ b/include/Nazara/Math/Frustum.hpp
@@ -46,6 +46,7 @@ namespace Nz
 			constexpr bool Contains(const Vector3<T>* points, std::size_t pointCount) const;
 
 			constexpr const Plane<T>& GetPlane(FrustumPlane plane) const;
+			constexpr const EnumArray<FrustumPlane, Plane<T>>& GetPlanes() const;
 
 			constexpr IntersectionSide Intersect(const BoundingVolume<T>& volume) const;
 			constexpr IntersectionSide Intersect(const Box<T>& box) const;
diff --git a/include/Nazara/Math/Frustum.inl b/include/Nazara/Math/Frustum.inl
index 24d82162d..ca8c7ef6b 100644
--- a/include/Nazara/Math/Frustum.inl
+++ b/include/Nazara/Math/Frustum.inl
@@ -239,6 +239,12 @@ namespace Nz
 		return m_planes[plane];
 	}
 
+	template<typename T>
+	constexpr const EnumArray<FrustumPlane, Plane<T>>& Frustum<T>::GetPlanes() const
+	{
+		return m_planes;
+	}
+
 	/*!
 	* \brief Checks whether or not a bounding volume intersects with the frustum
 	* \return IntersectionSide How the bounding volume is intersecting with the frustum