Hi everyone,
Im hoping someone can help me better understand the inner workings of the singular value decomposition (SVD).
Given a set of 3D points, I can find and fit the best plane by:
While it's clear that the procedural steps allow for the evaluation of p.n = 0, which satisfies the equation of a plane, could anyone break down how the SVD computes the best normal for the plane? Thanks in advance.