# Algorithm

# Algorithm

## Delaunay Triangulations

## EMST

Fast Euclidean Minimum Spanning Tree: Cover Tree

On the Euclidean Minimum Spanning Tree Problem: a randomized algorithm runs in an expected O(n) time.

A minimum spanning tree algorithm with inverse-Ackerman type complexity: A fast algorithm for general MST that is based on the soft heap

Efficient minimum spanning tree construction without Delaunay triangulation: an O(n \log{n}) sweep-line algorithm

The well-separated pair decomposition and its applications

## Metric Embeddings

Lecture notes on metric embeddings

## Planar Graph

any planar graph is 6-colorable

## Well-Separated Pair Decomposition

Well-Separated Pair Decomposition and Its Applications: A very clear article to introduce the WSPD.

## Alogrithm Problems

Confidential: the second minimum spanning tree