Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions

Keyphrases

• Expected Running Time 50%
• High-dimensional Space 50%
• Input Distribution 50%
• Lp-metric 50%
• Minimum Spanning Tree 100%
• Point Distribution 50%
• Polyhedral Metrics 50%
• Uniform Points 50%
• Well-separated Pair Decomposition 100%

Computer Science

• Distribution Point 50%
• Experimental Result 50%
• High Dimensional Space 50%
• Input Distribution 50%
• Minimum Spanning Tree 100%

Mathematics

• Dimensional Space 50%
• Minimum Spanning Tree 100%
• Running Time 50%