songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Add actual benchmark charts

This commit is contained in:
Sébastien Loriot 2020-04-16 17:46:53 +02:00
parent ddf8474580
commit 1ac0d9995f
2 changed files with 26 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Optimal_bounding_box/doc/Optimal_bounding_box/Doxyfile.in
View File

@ -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

31
Optimal_bounding_box/doc/Optimal_bounding_box/Optimal_bounding_box.txt
View File

@ -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