Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane (ArXiv cs.CG Recent Papers, 2026)