We propose a simple level set method for the Dirichlet k-partition problem which aims to partition an open domain into K different subdomains as minimize sum of smallest eigenvalue Laplace operator in each subdomain. first formulate nested minimization functional function and eigenfunction defined As approximation, we simply replace by so that can then be converted single problem. apply standar...

Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.