Appearance
Vessel coordinates
Definition
The cross-section at
where
In the classical choice the sections are the normal planes of the centerline, frame.sections = "harmonic"):
with the tilt
so that
Loading…
The sections of a real descending aorta along its length. Move the slider: the section is shown on the vessel (left) and in its own plane (right) with the axes
When the coordinates are a chart
Differentiating
and that
frame.fold_samples points (max_fold). The fold of a point of a section is a convex combination of the folds of points of its wall (it is linear, and every point of a section lies on a segment between two wall points in a line through it), so a value below one on the wall means that no two sections meet anywhere inside the encoded vessel, and the reconstruction cannot fold. The fold at the input vertices would not tell: every vertex is assigned the root of
Wall coordinates
The section through a point and its polar coordinates
Tilted sections
Normal sections fail in bends tighter than the vessel: the centerline's normal planes all pass through the centre of curvature, which then lies inside the vessel. The fix must turn the sections more slowly than the tangent on the inner side of the bend, while keeping them close to normal elsewhere. furca obtains them from the same harmonic field
Disjoint planar sections cannot cross inside the vessel. Let two planes cut the wall along disjoint closed curves
Level rings are not exactly planar, so furca takes for each ring its vector area
whose direction is the normal of a planar ring and, for any closed curve, the normal of the plane onto which it projects with the largest area. The rings are oriented consistently with frame.tilt_stiffness
The guarantee that sections do not cross belongs to the planes of the rings themselves; the smoother the fitted tilt, the further it departs from them. In a crease, where neighbouring rings nearly touch, their planes nearly meet at the wall and the fold approaches one: there the tilt must follow the rings closely. The tilt is therefore smoothed on a shorter scale than the centerline. On the tight-bend benchmark, a cut-off of 0.3 radii keeps the fold of the encoded wall below one up to
On the tight-bend benchmark the planes of the level rings cover every sampled point of the lumen exactly once for
Computation
- Initial guess. The centerline is sampled at the
frame.samples+ 1 nodes of the frame table and stored in a k-d tree. The nearest sample gives, which avoids starting on a different part of a curving centerline. - Bracketing. Since
decreases in the valid region, a point with has its section at larger . Steps of doubling length from in that direction bracket a sign change of . - Refinement. Newton steps
, with , are kept inside the bracket and replaced by bisection whenever they would leave it. Convergence is quadratic, to in . - Angle and radius. The section frame at
gives and .
Beyond the ends
Beyond its ends the centerline continues along its end tangents,
with
Reproducibility
For a given input, parameters and number of threads, results are bit-for-bit identical: parallel accumulations are done in fixed-size chunks combined in a fixed order. With a different number of threads, the dense linear algebra partitions its work differently and results differ at rounding level (observed below