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 intersection
Search options not deleted
user 13434
Questions on finding intersections of geometric objects: lines, planes, regions etc. with possible aid of ContourPlot, Interval, InfinitePlane and others.
1
vote
1
answer
561
views
Computing intersections between a large number of sets: doing it sequentially vs. sending ev...
One option would be to simply run the command:
Intersection[Q1, Q2, Q3, Q4, Q5, Q6, Q7, ...];
However, this seems to choke for very large numbers of input sets ($10^4$ or so with on-order $10^2$ elements … Another option would be compute Q12 = Intersection[Q1,Q2], then Q123 = Intersection[Q12,Q3], then Q1234 = Intersection[Q123,Q4], and so forth.
Are these two procedures equivalent? …
- 151