Timeline for Algorithm for creating adjacent triangles
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2012 at 4:59 | comment | added | House | @Kylotan does this solution not work? You mentioned in a comment to Jeff that Jimmy's image has two cases and one violates the constraints, but that's not true. In Jimmy's image the two cases would both produce valid triangles using my method. | |
| Jul 25, 2012 at 18:23 | history | edited | House | CC BY-SA 3.0 |
added 281 characters in body
|
| Jul 24, 2012 at 21:18 | history | edited | House | CC BY-SA 3.0 |
added 239 characters in body
|
| Jul 24, 2012 at 20:43 | comment | added | House | Ah yes, then you have two choices of where to put the triangle! Either side would work. Perhaps you can tie break with the one that has the shortest distance to the center. | |
| Jul 24, 2012 at 20:41 | comment | added | Jimmy | i.sstatic.net/iqLE8.png | |
| Jul 24, 2012 at 20:38 | comment | added | House | @Jimmy can you draw an image of such a situation? | |
| Jul 24, 2012 at 19:30 | comment | added | Jimmy | It's possible to have a situation where two of the lines do not intersect with edges (when X is closer to a vertex than it is to the edge) | |
| Jul 24, 2012 at 18:39 | history | edited | House | CC BY-SA 3.0 |
added 34 characters in body; added 9 characters in body
|
| Jul 24, 2012 at 18:29 | history | answered | House | CC BY-SA 3.0 |
