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

Explaining the performance test better.

This commit is contained in:
Nico Kruithof 2013-05-04 07:22:05 +02:00
parent 35a12e6101
commit 69a3d922c0
1 changed files with 13 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Periodic_2_triangulation_2.txt
View File

@ -387,10 +387,19 @@ In 2009, Nico Kruithof started implementation of the
\section P2T2_Performance Performance \section P2T2_Performance Performance
The performance of the 2D periodic Delaunay triangulation is compared The performance of the 2D periodic Delaunay triangulation is compared
to the Euclidean 2D Delaunay triangulation. The plot shows the running to the Euclidean 2D Delaunay triangulation. The points are inserted in
time in seconds for different numbers of batch inserted points. The the Euclidean 2D Delaunay triangulation using spatial sorting. In the
points are uniformly randomly distributed in the unit rectangle. The Periodic triangulation the points are first inserted in random order
tests were done on an Intel i7 @ 2.67GHz. until the triangulation is valid in the 1 sheeted covering space. The
remaining points are then inserted using spatial sorting. For the
large point set, first dummy points are inserted to create a valid
triangulation in the 1 sheeted covering space. Then all points are
inserted using spatial sorting. As a final step, the dummy points are
removed again.
The plot shows the running time in seconds for different numbers of
batch inserted points. The points are uniformly randomly distributed
in the unit rectangle. The tests were done on an Intel i7 @ 2.67GHz.
\image html p2dt2_performance.png \image html p2dt2_performance.png