Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with mg.metric-geometry
Search options not deleted
user 70313
Euclidean, hyperbolic, discrete, convex, coarse geometry, metric spaces, comparisons in Riemannian geometry, symmetric spaces.
4
votes
closest equidistant point to N points in M dimensions
If such a point exists, then it is the center of a sphere on which all $N$ points lie, so I think your question is equivalent to asking, do all $N$ points lie on some sphere? Since $M+1$ points deter …
- 553
1
vote
Blowing up spheres in a face centered cubic (fcc) packing geometry just enough to cover the ...
Although not directly answering the question, the discussion here highlights connections between the question of $R_v$ and the Voronoi cell of this lattice. In short, it turns out that $R_v$ is the m …
- 553
1
vote
Diameter of random segment intersection graph?
I don't have sufficient privileges to add a comment, but I wanted to ask if your evidence is consistent with the conclusion that the diameter of $G$ increases logarithmically with $n$. That would hav …
- 553