Minimum-sum dipolar spanning tree in \(\mathbb R^3\)

DOI10.1016/j.comgeo.2010.09.011zbMath1251.65017arXiv1007.1222MaRDI QIDQ452446

Ovidiu Daescu, Steven Bitner

Publication date: 21 September 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.1222

zbMATH Keywords

algorithm; communication networks; computational geometry; dipolar spanning tree; intersection of balls

Mathematics Subject Classification ID

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

94C05: Analytic circuit theory

Cites Work

• The discrete 2-center problem
• A near-linear algorithm for the planar 2-center problem
• Facility location and the geometric minimum-diameter spanning tree.
• Efficiently approximating polygonal paths in three and higher dimensions
• Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Minimum Diameter Spanning Trees and Related Problems
• An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
• Finding Minimum Spanning Trees
• Computational Geometry in C
• Semi-Online Maintenance of Geometric Optima and Measures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item