This paper discusses the theory and algorithmic design of the CADD (Clustering Algorithm based on object Density and Direction) algorithm. This algorithm seeks to harness the respective advantages of the Kmeans and DENCLUE algorithms. Clustering results are illustrated using both a simple data set and one from the geological domain. Results indicate that CADD is robust in that automatically determines the number K of clusters, and is capable of identifying clusters of multiple shapes and sizes.