Hierarchical clustering limits on large datasets due to O(n²) complexity. K-means scales better, especially with subsampling or scikit-learn’s MiniBatchKMeans for faster clustering. Memory optimization via float32 reduces footprint. Distributed computing with Dask enables large-scale spatial data processing.