From 1ac0d9995f94a4f90ebf751df92d94a6d427c2cb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Apr 2020 17:46:53 +0200
Subject: [PATCH] Add actual benchmark charts

---
 .../doc/Optimal_bounding_box/Doxyfile.in      |  5 +--
 .../Optimal_bounding_box.txt                  | 31 ++++++++++++++-----
 2 files changed, 26 insertions(+), 10 deletions(-)

diff --git a/Optimal_bounding_box/doc/Optimal_bounding_box/Doxyfile.in b/Optimal_bounding_box/doc/Optimal_bounding_box/Doxyfile.in
index 057f5441d8d..cdcca39a7c8 100644
--- a/Optimal_bounding_box/doc/Optimal_bounding_box/Doxyfile.in
+++ b/Optimal_bounding_box/doc/Optimal_bounding_box/Doxyfile.in
@@ -25,5 +25,6 @@ EXCLUDE = ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Optimal_bounding_box/internal
 EXCLUDE_SYMBOLS += experimental
 
 HTML_EXTRA_FILES           =  ${CGAL_PACKAGE_DOC_DIR}/fig/aabb_vs_obb.jpg \
-                              ${CGAL_PACKAGE_DOC_DIR}/fig/obb_chess.png
-
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/obb_chess.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/obb_time.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/ch_speedup.png
diff --git a/Optimal_bounding_box/doc/Optimal_bounding_box/Optimal_bounding_box.txt b/Optimal_bounding_box/doc/Optimal_bounding_box/Optimal_bounding_box.txt
index 5e987a4b9ab..218a57c3c2d 100644
--- a/Optimal_bounding_box/doc/Optimal_bounding_box/Optimal_bounding_box.txt
+++ b/Optimal_bounding_box/doc/Optimal_bounding_box/Optimal_bounding_box.txt
@@ -122,23 +122,38 @@ with speeds being averaged over 100 runs for each model. The machine used is a l
 
 \subsection OBBConvexHullComplexity Cost and Gain of Convex Hull Computations
 
-Computing the convex hull as a preliminary step provides a significant speed advantage,
-and never worsens the result in our tests.
+Computing the convex hull as a preliminary step provides a significant speed advantage.
 
-\cgalFigureBegin{ch_speed_up, ch_speedup.png}
-Speed-up obtained by computing the oriented bounding box of the convex hull of the data.
-It is always beneficial to construct and use the convex hull.
-\cgalFigureEnd
+\cgalFigureAnchor{ch_speed_up}
+<center>
+<img src="ch_speedup.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{ch_speed_up}
+Comparison of the runtime of the compelte algorithm depending on whether the convex hull is computed
+and used afterwards, or not.
+The color and size of the dots represent the number of vertices in the input data (larger, bluer points
+having more input vertices than greener, smaller points).
+Computing the convex hull is beneficial for all but a handful of cases.
+\cgalFigureCaptionEnd
 
 \subsection OBBOrientedBoundingBoxComplexity Performance of the Oriented Bounding Box Algorithm
 
 We analyze in this section the computation time of the algorithm based on the number of vertices
 on the convex hull.
 
-\cgalFigureBegin{obb_timings, obb_time.jpg}
+\cgalFigureAnchor{obb_timings}
+<center>
+<img src="obb_time.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{obb_timings}
 Running times for the oriented bounding box construction of the convex hull of models
 of the <a href="https://ten-thousand-models.appspot.com/">Thingi10k</a> data set.
-\cgalFigureEnd
+The color and size of the dots represent the number of vertices in the input data (larger, bluer points
+having more input vertices than greener, smaller points).
+The algorithm exhibits linear complexity in practice.
+For visibility reasons, the few models whose convex hull has more than 10000 vertices
+are excluded from this graph, but consistent results are observed.
+\cgalFigureCaptionEnd
 
 \section OBBexamples Examples