Timeline for Iterated Circumcircle
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 13, 2017 at 9:49 | history | suggested | Martin Sleziak |
removed deprecated (geometry) tag - see the tag info: http://mathoverflow.net/tags/geometry/info
|
|
| Apr 13, 2017 at 9:43 | review | Suggested edits | |||
| S Apr 13, 2017 at 9:49 | |||||
| Apr 10, 2017 at 22:13 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image link broken; now fixed.
|
| Sep 10, 2010 at 12:55 | answer | added | sleepless in beantown | timeline score: 3 | |
| Sep 10, 2010 at 11:59 | history | edited | Joseph O'Rourke | CC BY-SA 2.5 |
Accepting Victor's answer.
|
| Sep 10, 2010 at 11:59 | vote | accept | Joseph O'Rourke | ||
| Jun 16, 2010 at 4:49 | comment | added | Victor Protsak | Side length is irrelevant and in comments to my answer, Ian Morris gave an argument that blue (divergent) points have full measure. I think that red (convergent) rational angles are dense. | |
| Jun 14, 2010 at 11:59 | history | edited | Joseph O'Rourke | CC BY-SA 2.5 |
Reformulated a sharper question, based on comments from Scott Carnahan, Victor Protsak, Gehard Paseman.
|
| Jun 14, 2010 at 9:11 | comment | added | Ian Morris | I've seen a related, but certainly not identical, deterministic process defined in terms of the circle inscribed in the triangle formed by the three points: maths.warwick.ac.uk/%7Empollic/inscribed.pdf | |
| Jun 14, 2010 at 7:44 | comment | added | Victor Protsak | Theo, this can be analyzed using the method given in my answer. | |
| Jun 14, 2010 at 7:40 | history | edited | Victor Protsak |
edited tags
|
|
| Jun 14, 2010 at 3:07 | answer | added | Victor Protsak | timeline score: 15 | |
| Jun 14, 2010 at 2:57 | comment | added | Theo Johnson-Freyd | Have you tried the deterministic process where you start with picking three points in order, and then at each step replace the oldest point by the new circumcenter? I'd be curious to know the answer to that maybe simpler problem, too. | |
| Jun 14, 2010 at 1:50 | answer | added | S. Carnahan♦ | timeline score: 3 | |
| Jun 14, 2010 at 0:47 | answer | added | Bart Snapp | timeline score: 2 | |
| Jun 14, 2010 at 0:06 | comment | added | Gerhard Paseman | The idea for the above graph series is it may help you find a Mandelbrot-like set. Gerhard "Ask Me About System Design" Paseman, 2010.06.13 | |
| Jun 14, 2010 at 0:05 | answer | added | Michael Hardy | timeline score: 2 | |
| Jun 14, 2010 at 0:04 | comment | added | Gerhard Paseman | Make the following series of graphs. Graph 1 : Fix line segment a,b. For each noncollinear c, compute circumcenter x and color c depending on whether a,b,x is a "divergent" triangle. Use area, or distance from a,b, or something else to define "divergent". Hopefully the two-color scheme yields some information. Graph 2a: like Graph 1, then compute c-center y from a,b,x, look at a,x,y, and color c when a,x,y is divergent or not. Graphs 2b, 2c, same as 2a, but using b,x,y or a,b,y. Graph n is the nth iteration. Gerhard "Ask Me About System Design" Paseman, 2010.04.13 | |
| Jun 13, 2010 at 23:25 | history | asked | Joseph O'Rourke | CC BY-SA 2.5 |