Expand description
Bridging two boundary loops with a triangle tube.
bridge_loops stitches a tube between two boundary loops identified by
LoopId. The correspondence is a minimum-area dynamic
program over the loop-by-loop grid with a full start search, so loops of
different lengths zip without twist. The loops must wind in opposite
directions (their Newell vectors must oppose); same-winding loops admit
no outward tube that is manifold at both rims and are rejected. The whole
strip is planned first and committed through one
Transaction, so the call is atomic.
Structs§
- Bridge
Options - Options for
bridge_loops. - Bridge
Options Builder - Builder for
BridgeOptions. - Bridge
Report - Outcome of
bridge_loops.
Constants§
- BRIDGE_
DEFAULT_ MAX_ EDGES - Default cap on each loop’s length in vertices. Explicit
max_edgesoverrides it; the dynamic program costs O(starts x cells), so raising the bound past a few hundred gets slow before it gets big.
Functions§
- bridge_
loops - Stitches a tube between the two loops in
options.