# Shortest triangulation is in general not a Delaunay triangulation

Let $P$ be a set of points. The minimal triangulation of $P$ is a triangulation $T$ of the points in $P$ such that the total length of the edges in $T$ is the smallest possible amongst all possible triangulations of $P.$

I am looking for the smallest (and most concise) example such that the Delaunay triangulation of $P$ is not equal to the minimal triangulation of $P.$

Anyone happens to have a good example of this?

-