Is subspace clustering better than spectral clustering?

After reading a few papers about subspace clustering (e.g. the one by Elhamifar and Vidal), it looks like subspace clustering includes scenario of applying spectral clustering: it works for data distributed in a union of subspaces, while spectral clustering works for just one subspace; also some algorithms of subspace clustering (e.g. the linked reference) uses spectral clustering as one step in their algorithm.

So I wonder if that means subspace clustering always performs better than spectral clustering? If those subspaces are close enough, maybe there's not really a difference between the two? However none of the papers I found about subspace clustering includes performance comparison with spectral clustering.