forgot directory

This commit is contained in:
Andreas Fabri 2007-02-23 09:28:44 +00:00
parent f3d98caccb
commit 5e08db9c45
1 changed files with 5 additions and 5 deletions

View File

@ -164,8 +164,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 \ccReferToExampleCode{ex_sum_with_holes.cpp} and
\ccReferToExampleCode{ex_sum_by_decomposition.cpp}.}
as done in the example programs \ccReferToExampleCode{Minkowski_sum_2/ex_sum_with_holes.cpp} and
\ccReferToExampleCode{Minkowski_sum_2/ex_sum_by_decomposition.cpp}.}
\label{mink_fig:sum_holes}
\end{figure}
@ -239,7 +239,7 @@ vertex.
\end{itemize}
The following example demonstrates the computation of the Minkowski sum
of the same input polygons as used in \ccReferToExampleCode{ex_sum_with_holes.cpp} (as
of the same input polygons as used in \ccReferToExampleCode{Minkowski_sum_2/ex_sum_with_holes.cpp} (as
depicted in Figure~\ref{mink_fig:sum_holes}), using the small-side
angle-bisector decomposition strategy:
@ -428,7 +428,7 @@ of line segments and circular arcs).
</center>
\end{ccHtmlOnly}
\caption{The offset computation performed by the example programs
\ccReferToExampleCode{ex_approx_offset.cpp} and \ccReferToExampleCode{ex_exact_offset.cpp}. The input polygon
\ccReferToExampleCode{Minkowski_sum_2/ex_approx_offset.cpp} and \ccReferToExampleCode{Minkowski_sum_2/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}
@ -461,7 +461,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
\ccReferToExampleCode{ex_approx_offset.cpp}, presented in the previous subsection (see also
\ccReferToExampleCode{Minkowski_sum_2/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