Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 05:18, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum-sum dipolar spanning tree in \(\mathbb R^3\) |
scientific article |
Statements
Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (English)
0 references
21 September 2012
0 references
computational geometry
0 references
dipolar spanning tree
0 references
algorithm
0 references
intersection of balls
0 references
communication networks
0 references