diff --git a/.gitattributes b/.gitattributes index de6fcb70d18..05e9be7e050 100644 --- a/.gitattributes +++ b/.gitattributes @@ -3984,6 +3984,7 @@ Partition_2/doc/Partition_2/fig/Idar-Oberstein_appx_cvx.pdf -text svneol=unset#a Partition_2/doc/Partition_2/fig/Partition_2-teaser-small.png -text svneol=unset#image/png Partition_2/doc/Partition_2/fig/Trier_opt_cvx.gif -text svneol=unset#image/gif Partition_2/doc/Partition_2/fig/Trier_opt_cvx.pdf -text svneol=unset#application/pdf +Partition_2/doc/Partition_2/fig/approximate_optimal_vs_optimal.png -text svneol=unset#image/png Partition_2/doc/Partition_2/fig/teaser.png -text svneol=unset#image/png Partition_2/doc_tex/Partition_2/Idar-Oberstein_appx_cvx.gif -text svneol=unset#image/gif Partition_2/doc_tex/Partition_2/Idar-Oberstein_appx_cvx.pdf -text svneol=unset#application/pdf diff --git a/Partition_2/doc/Partition_2/Partition_2.txt b/Partition_2/doc/Partition_2/Partition_2.txt index 6168e2b3ad1..a4bb1678035 100644 --- a/Partition_2/doc/Partition_2/Partition_2.txt +++ b/Partition_2/doc/Partition_2/Partition_2.txt @@ -50,13 +50,7 @@ which determines if a sequence of points in 2D defines a \f$ y\f$-monotone polygon or not. For examples of the use of these functions, see the corresponding reference pages. -\image latex Trier_opt_cvx "" width=6.5cm -\image latex Idar-Oberstein_appx_cvx "" width=6.5cm -\image html Trier_opt_cvx.gif -\image html Idar-Oberstein_appx_cvx.gif -
-Examples of an optimal convex partition (left) and an approximately optimal convex partition (right). -
+\image html approximate_optimal_vs_optimal.png "Examples of an approximate optimal convex partition (left) and an optimal convex partition (right)." \section secpartition_2_convex Convex Partitioning diff --git a/Partition_2/doc/Partition_2/fig/approximate_optimal_vs_optimal.png b/Partition_2/doc/Partition_2/fig/approximate_optimal_vs_optimal.png new file mode 100755 index 00000000000..cd00c83eca0 Binary files /dev/null and b/Partition_2/doc/Partition_2/fig/approximate_optimal_vs_optimal.png differ