Performance

Node Access

Ordered Access

Ordered access of the nodes. This test is performed on an orthtree with $2^{12} = 4096$ nodes. The time per access is given in nanoseconds.

Dimension 1 2 3 4
Time 18 17 21 19

Ordered access of the nodes. Next we test access times for a 3-D orthtree of varying sizes.

Nodes 64 512 4,096 32,768 262,144
Time 15 19 22 23 37

Random Access

Random access of the nodes. This test is performed on an orthtree with $2^{12} = 4096$ nodes. The time per access is given in nanoseconds.

Dimension 1 2 3 4
Time 148 149 159 148

Random access of the nodes. Next we test access times for a 3-D orthtree of varying sizes.

Nodes 64 512 4,096 32,768 262,144
Time 71 98 159 237 782

Refinement

Refinement operations. This test is performed on an orthtree with up to $2^{12} = 4096$ nodes. The time per refinement is given in nanoseconds.

Dimension 1 2 3 4
Time 575 1210 2660 5950

Next we test refinement times for a 3-D orthtree of varying sizes.

Nodes 64 512 4,096 32,768 262,144
Time 2270 2460 2710 2980 3660

Coarsening

Coarsening operations. This test is performed on an orthtree with up to $2^{12} = 4096$ nodes. The time per coarsening operation is given in nanoseconds.

Dimension 1 2 3 4
Time 517 1030 2160 4480

Next we test coarsening times for a 3-D orthtree of varying sizes.

Nodes 64 512 4,096 32,768 262,144
Time 2100 2210 2220 2360 3070

Finding Neighbors

Finding neighbors. This test is performed on an orthtree with $2^{12} = 4096$ nodes. The time per operation is given in nanoseconds.

Dimension 1 2 3 4
Time per neighbor 192 188 188 249
Time per node 384 739 1060 1750

Next we time the operations for a 3-D orthtree of varying sizes.

Nodes 64 512 4,096 32,768 262,144
Time per neighbor 124 158 190 225 221
Time per node 558 830 1070 1310 1310
Generated on Thu Jun 30 02:14:58 2016 for Computational Geometry Package by  doxygen 1.6.3