1. A method for partitioning an integrated circuit, comprising: partitioning an input set of points into a binary tree of partitions so that each leaf partition has maximally a defined number of points; making graph edges for the points by connecting each point to its closest point in every of 2 K subspaces; and reducing number of graph elements to predefined value.