d-meiser / hpcgeom / 72

Ran 29 Jul 2018 03:32PM UTC

Jobs 2

Files 0

Run time –

Badge

Embed ▾

pending completion

Build # 72

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

Jobs

ID	Job ID	Ran	Files	Coverage
3	72.3 (BUILD_TYPE=Debug)	29 Jul 2018 03:32PM UTC	0	86.28	Travis Job 72.3
4	72.4 (BUILD_TYPE=Debug)	29 Jul 2018 03:32PM UTC	0		Travis Job 72.4

Source Files on build 72

Detailed source file information is not available for this build.

d-meiser / hpcgeom / 72

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 72

d-meiser / hpcgeom / 72

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 72

README BADGES
x