Boundary extraction is a fundamental post-clustering problem. It facilitates interpretability and usability of clustering results. Also, it provides visualization and dataset reduction. However, it has not attracted much attention compared to the clustering problem itself. In this work, we address the boundary extraction of clusters in 2- and 3-dimensional spatial datasets. We propose two algorithms based on Delaunay Triangulation (DT). Numerical experiments show that the proposed algorithms generate the cluster boundaries effectively. Also, they yield significant amounts of dataset reduction.