computeLODGeometry
computeLODGeometry(
tree,graph,leafRadii,leafWeight?,leafBorder?,leafColors?,radiusAggregate?,discs?,bounds?,fillAggregate?,leafBorderFlow?):void
Defined in: network/lod.ts:1716
Fill the tree’s full geometry from the settled layout, the per-leaf visual radii, and a per-leaf importance weight — computeLODPositions then computeLODStyle. The main-thread path (synchronous solve / supplied positions); the worker backend splits these passes across threads.
leafRadii is the resolved per-node radius (so aggregates respect the node sizing); leafWeight
is the per-leaf importance, defaulting to graph.strength (weighted degree) — pass graph.flow
or graph.csr.degree to prioritise differently. discs places each module on its nested-layout
disc (#329, see computeLODPositions); bounds is the position pass’s reusable box scratch —
without one the pass reuses a shared scratch, so a repeated call allocates nothing for it.
Parameters
Section titled “Parameters”leafRadii
Section titled “leafRadii”ArrayLike<number>
leafWeight?
Section titled “leafWeight?”ArrayLike<number> = graph.strength
leafBorder?
Section titled “leafBorder?”ArrayLike<number>
leafColors?
Section titled “leafColors?”ArrayLike<number>
radiusAggregate?
Section titled “radiusAggregate?”RadiusAggregate
discs?
Section titled “discs?”bounds?
Section titled “bounds?”LODBoundsScratch
fillAggregate?
Section titled “fillAggregate?”FillAggregate
leafBorderFlow?
Section titled “leafBorderFlow?”ArrayLike<number>
Returns
Section titled “Returns”void