Data Structures

Watershed by Flooding: Applied Data Structures

Computing a gradient map on a cortical surface mesh by regressing scalar values onto neighbors projected into the tangent plane. The gradient map is then segmented with a priority-flooding watershed algorithm built on a heap-based priority queue.