Changed .C to .cpp in the Manual.

Minkowski_sum_2/doc_tex/Minkowski_sum_2/mink_sum.tex

@@ -134,7 +134,7 @@ contains \ccc{S.number_of_holes()} holes in its interior).
   </center>
 \end{ccHtmlOnly}
 \caption{Computing the Minkowski sum of two triangles, as done
-in the example program \ccc{ex_sum_triangles.C}.}
+in the example program \ccc{ex_sum_triangles.cpp}.}
 \label{mink_fig:sum_tri}
 \end{figure}
 
@@ -160,8 +160,8 @@ The file \ccc{print_util.h} includes auxiliary functions for printing polygons.
   </center>
 \end{ccHtmlOnly}
 \caption{Computing the Minkowski sum of two non-convex polygons $P$ and $Q$,
-as done in the example programs \ccc{ex_sum_with_holes.C} and
-\ccc{ex_sum_by_decomposition.C}.}
+as done in the example programs \ccc{ex_sum_with_holes.cpp} and
+\ccc{ex_sum_by_decomposition.cpp}.}
 \label{mink_fig:sum_holes}
 \end{figure}
 
@@ -235,7 +235,7 @@ vertex.
 \end{itemize}
 
 The following example demonstrates the computation of the Minkowski sum
-of the same input polygons as used in \ccc{ex_sum_with_holes.C} (as
+of the same input polygons as used in \ccc{ex_sum_with_holes.cpp} (as
 depicted in Figure~\ref{mink_fig:sum_holes}), using the small-side
 angle-bisector decomposition strategy:
 
@@ -419,7 +419,7 @@ of line segments and circular arcs).
   </center>
 \end{ccHtmlOnly}
 \caption{The offset computation performed by the example programs
-\ccc{ex_approx_offset.C} and \ccc{ex_exact_offset.C}. The input polygon
+\ccc{ex_approx_offset.cpp} and \ccc{ex_exact_offset.cpp}. The input polygon
 is shaded and the boundary of its offset is drawn in a thick black line.}
 \label{mink_fig:ex_offset}
 \end{figure}
@@ -452,7 +452,7 @@ exact offset polygon.
 
 The following example demonstrates the construction of the offset
 of the same polygon that serves as an input for the example program
-\ccc{ex_approx_offset.C}, presented in the previous subsection (see also
+\ccc{ex_approx_offset.cpp}, presented in the previous subsection (see also
 Figure~\ref{mink_fig:ex_offset}). Note that the resulting polygon is
 smaller than the one generated by the approximated-offset function (recall
 that each irrational line segment in this case is approximated by two