In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data space.The goal of the proposed algorithm is to use the finite support property of kernels for fast estimation of density. Compared to earlier approaches, this work explains the need of using boundaries (for partitioning the space) instead of centroids (used in earlier approaches), for better unsupervised nature (less user incorporation), and lesser (or atleast same) computational complexity. In earlier approaches, the finite support of a fixed kernel varies within the space due to the use of cluster centroids. It has been argued that if one uses boundaries (for partitioning) rather than centroids, the finite support of a fixed kernel does not change for a constant precision error. This fact introduces better unsupervision within the estimation framework. The main contribution of this work is the insight gained...