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 euclidean-geometry
Search options not deleted
user 4354
Euclidean geometry is a mathematical system attributed to the Alexandrian Greek mathematician Euclid, which he described in his textbook on geometry: the Elements. Euclid's method consists in assuming a small set of intuitively appealing axioms, and deducing many other propositions (theorems) from these.
2
votes
Worst-case nearest-neighbor distances between regions
I assume you are seeking a lower bound for $r$ for configurations of a fixed total area $A$, otherwise it just does not make sense.
Yes the bound is $\sim C\sqrt{A/n}$ for some constant $C>0$ but I d …
- 32.4k
6
votes
Determine if circle is covered by some set of other circles
The problem (for discs of arbitrary radii) is essentially equivalent to the following: given a convex polyhedral set in $\mathbb R^3$ (represented by a system of linear inequalities), determine whethe …
- 32.4k
13
votes
The Ramanujan Problems
Concerning the planimetry problem: Having a suitable background, it is not hard to produce many puzzles like this. For example, here is one more pair of points on that mysterious circle: intersect a c …
- 32.4k