d-meiser / hpcgeom / 72 / 3

Ran 29 Jul 2018 03:32PM UTC

Files 10

Run time 0s

Badge

Embed ▾

Committed 29 Jul 2018 03:03PM UTC coverage: 86.279% (+0.3%) from 85.93%

Job # BUILD_TYPE=Debug

Build Type

push

travis-ci

Committed by

d-meiser

Commit Message

Optimize insertion of items into BVH: flat sort of hashes

Previously we were first partitioning the hashes into levels and then
sorting each level. But sorting by node keys induces sorting by levels.
Therefore we can more efficiently sort and partition by first sorting
the whole array of hashes and then doing bisection searches for the
level partitions.

Also remove adaptation of bounding box of BVH since this was not
implemented properly. If we want to do this we have to do it right.

Run Details

742 of 860 relevant lines covered (86.28%)

3458.2 hits per line

d-meiser / hpcgeom / 72 / 3

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 72.3 (BUILD_TYPE=Debug)

d-meiser / hpcgeom / 72 / 3

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 72.3 (BUILD_TYPE=Debug)

README BADGES
x