Text this: Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane