Topology Hash Functions

From VTKM
Revision as of 16:25, 4 April 2017 by Kmorel (talk | contribs) (Created page with "== Ideas == === Vec of Ids === '''Pros:''' * Relatively easy to make and understand * Guaranteed to be unique '''Cons:''' * Slow to sort * Have to make conanical === Morto...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Ideas

Vec of Ids

Pros:

  • Relatively easy to make and understand
  • Guaranteed to be unique

Cons:

  • Slow to sort
  • Have to make conanical

Morton Code

Pros:

  • Potentially much faster sort
  • Usually 1/3 size

Cons:

  • Have to make conoical
  • Can get collisions

Push to Hash

(Brent's paper)

Was measured faster than a sorting approach, especially if the order of the points/cells were randomized.

Sorting was using merge, not radix.