Improved algorithm for generating evenly-spaced streamlines from an orientation field on a triangulated surface
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
BACKGROUND: Vector fields such as cardiac fiber orientation can be visualized on a surface using streamlines. The application of evenly-spaced streamline generation to the construction of interconnected cable structure for cardiac propagation models has more stringent requirements imperfectly fulfilled by current algorithms. METHOD: We developed an open-source C++/python package for the placement of evenly-spaced streamlines on a triangulated surface. The new algorithm improves upon previous works by more accurately handling streamline extremities, U-turns and limit cycles, by providing stronger geometrical guarantees on inter-streamline minimal distance, particularly when a high density of streamlines (up to 10μm spacing) is desired, and by making a more efficient parallel implementation available. The approach requires finding intersections between geometrical capsules and triangles to update an occupancy mask defined on the triangles. This enables fast streamline integration from thousands of seed points to identify optimal streamline placement. RESULTS: The algorithm was assessed qualitatively on different left atrial models of fiber orientation with varying mesh resolutions (up to 375k triangles) and quantitatively by measuring streamline lengths and distribution of inter-streamline minimal distance. The complexity and the computational performance of the algorithm were studied as a function of streamline spacing in relation to triangular mesh resolution. CONCLUSION: More accurate geometrical computations, attention to details and fine-tuning led to an algorithm more amenable to applications that require precise positioning of streamlines.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it