mirror of https://github.com/CGAL/cgal
forgot directory
This commit is contained in:
parent
f3d98caccb
commit
5e08db9c45
|
|
@ -164,8 +164,8 @@ The file \ccc{print_util.h} includes auxiliary functions for printing polygons.
|
||||||
</center>
|
</center>
|
||||||
\end{ccHtmlOnly}
|
\end{ccHtmlOnly}
|
||||||
\caption{Computing the Minkowski sum of two non-convex polygons $P$ and $Q$,
|
\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
|
as done in the example programs \ccReferToExampleCode{Minkowski_sum_2/ex_sum_with_holes.cpp} and
|
||||||
\ccReferToExampleCode{ex_sum_by_decomposition.cpp}.}
|
\ccReferToExampleCode{Minkowski_sum_2/ex_sum_by_decomposition.cpp}.}
|
||||||
\label{mink_fig:sum_holes}
|
\label{mink_fig:sum_holes}
|
||||||
\end{figure}
|
\end{figure}
|
||||||
|
|
||||||
|
|
@ -239,7 +239,7 @@ vertex.
|
||||||
\end{itemize}
|
\end{itemize}
|
||||||
|
|
||||||
The following example demonstrates the computation of the Minkowski sum
|
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
|
depicted in Figure~\ref{mink_fig:sum_holes}), using the small-side
|
||||||
angle-bisector decomposition strategy:
|
angle-bisector decomposition strategy:
|
||||||
|
|
||||||
|
|
@ -428,7 +428,7 @@ of line segments and circular arcs).
|
||||||
</center>
|
</center>
|
||||||
\end{ccHtmlOnly}
|
\end{ccHtmlOnly}
|
||||||
\caption{The offset computation performed by the example programs
|
\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.}
|
is shaded and the boundary of its offset is drawn in a thick black line.}
|
||||||
\label{mink_fig:ex_offset}
|
\label{mink_fig:ex_offset}
|
||||||
\end{figure}
|
\end{figure}
|
||||||
|
|
@ -461,7 +461,7 @@ exact offset polygon.
|
||||||
|
|
||||||
The following example demonstrates the construction of the offset
|
The following example demonstrates the construction of the offset
|
||||||
of the same polygon that serves as an input for the example program
|
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
|
Figure~\ref{mink_fig:ex_offset}). Note that the resulting polygon is
|
||||||
smaller than the one generated by the approximated-offset function (recall
|
smaller than the one generated by the approximated-offset function (recall
|
||||||
that each irrational line segment in this case is approximated by two
|
that each irrational line segment in this case is approximated by two
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue