Si presenta un algoritmo per collegare due triangolazioni \textquotedbl{}minimali\textquotedbl{}
del piano proiettivo complesso $\mathbb{C\textrm{P}}^{2}$. La prima
è la triangolazione simpliciale a 9 vertici di K$\ddot{\textrm{u}}$hnel
$\left[BK\right]$; la seconda è la triangolazione contratta di $\mathbb{C\textrm{P}}^{2}$
costruita dal terzo autore in $\left[G\right]$. We present an explicit algorithm for linking two \textquotedbl{}minimal\textquotedbl{}
triangulations of the complex projective plane $\mathbb{C\textrm{P}}^{2}$.The
first one is the \textquotedbl{}9-vertex\textquotedbl{} simplicial
triangulation found by K$\ddot{\textrm{u}}$hnel $\left[BK\right]$;
the second one is the contracted triangulation of $\mathbb{C\textrm{P}}^{2}$,
built by the third author in $\left[G\right]$.
