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 discrete-geometry
Search options not deleted
user 35626
Finite or discrete collections of geometric objects. Packings, tilings, polyhedra, polytopes, intersection, arrangements, rigidity.
2
votes
Diameter of random segment intersection graph?
Here is a way of thinking. It may turn out to be misleading, but it may also suggest a
way to think properly about this problem.
Lets take a random instance of a matching and reconstruct it edge by …
- 2,158
2
votes
Inside-out polygonal dissections
Riffing off the tiling comment to another answer, imagine a square penny packing of circles,
and then translate the tiling so that a circle is in the center of four other circles. Now replace
each of …
- 2,158
3
votes
Wait time to grid network disconnection with failing edges
Instead of answering the question, I will suggest some modifications
that should make the model easier to analyze.
I will denote the number of vertices as v, and the number of edges as
dv for the d-d …
- 2,158