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 plane-geometry
Search options not deleted
user 122610
Plane Geometry is about flat shapes like lines, circles and triangles , shapes that can be drawn on a piece of paper
0
votes
Cutting a square into an infinite number of triangles constrained by two rules
I'm not sure if it's rigorous enough, but I think you can start with a regular triangulation with roughly $N \times M$ vertices, then shift the vertix at point $(x,y)$ by $(\epsilon x/N, \epsilon y/M) …
