# Tag Info

Accepted

### Should planar Euclidean graphs be planar straight-line graphs?

FĂˇry's theorem states that every planar graph can be drawn in such a way that its edges are (non-crossing) straight lines. Hence every planar graph is a planar straight-line graph. However, this ...
• 277k
Accepted

### Embedding from $L^\infty$ space to $L^2$ space

The answer is unfortunately negative in general, by combining the following two well-known facts: Every metric space on $n$ points embeds isometrically into $(n-1)$-dimensional $L^\infty$. Embedding ...
• 277k
Accepted

• 2,522
Accepted

### Finding Euclidean Minimum Spanning Tree

If you're asking this question because you want something easier to implement than a Delaunay triangulation algorithm you're most likely out of luck. You should also specify in what space you're ...
• 574
Accepted

### Splitting a set of points in the plane evenly and sorting it

This is not so hard to fix. First, calculate the median $m$. Then calculate the number of points strictly left of the median $\ell$. Take all of them from Py, and take the first $n/2-\ell$ points ...
• 277k
Accepted

• 277k
1 vote
Accepted

### In most locality sensitive hashing implemensions of SimHash, why is the cosine distance used and not the euclidean distance?

Cosine distance is common in Information Retrieval and other text-based scenarios because text is most easily represented as high dimensional sparse vectors in the word space. A few specific ...
1 vote
Accepted

### Comparison between: Maximum Absolute Difference & Min Steps in Infinite Grid

It is nice that you try to draw a comparison between two similar situations. However, it looks like you are driving too fast to stay on the right road. Henceforth I will be moving somewhat slowly so ...
• 39k
1 vote

### Computational complexity comparison of floating-point Euclidean distance calculation with binary fixed-point Hamming-distance calculation

The asymptotic complexity for the worst case is the same. Actually, the constant factors will be quite close together on a typical modern processor - if you don't calculate the execution time ...
• 30k

Only top scored, non community-wiki answers of a minimum length are eligible