Professor of Computer Science, Professor of Mathematics
|
5h
|
|
comment |
Convex hull algorithms for sorted set of points @Alexey: I don't believe your sorting helps, at least in terms of asymptotics. Perhaps just using the incremental algorithm but adding the points in sorted order would be efficient... |
|
May
18 |
|
comment |
Convex hull algorithms for sorted set of points @Alexey: When one says "sorted set of points in 3 and higher dimensions," the only interpretation of "sorted" that is natural is "sorted by one coordinate." Even in 2D, "sorted by one coordinate" is not at all the same as "sorted angularly about an interior point." And there is no equivalent in 3D of "sorted angularly." So I guess I need an explanation of what it means to you for points to be sorted in 3D. |
|
May
15 |
|
answered | Convex hull algorithms for sorted set of points |
|
May
14 |
|
revised |
Following a polyline along the surface of a polygon that is twisted added 94 characters in body |
|
May
12 |
|
accepted | Probability of retirement event |
|
May
12 |
|
comment |
Probability of retirement event Here is an example. If $\mu=70$ and $\sigma=5$, then $F(76)=0.88$ and $F(75)=0.84$, and your expression yields $0.25$. So there is only actually a small chance that this 75-yr-old will retire, whereas I would think it would be larger. An 80-yr-old only has a 39% chance of retiring. Maybe the normal distribution assumption is the culprit here. |
|
May
11 |
|
comment |
Probability of retirement event @user17762 and Sh3ljohn: Thank you! I need to think about this more before replying substantively... |
|
May
11 |
|
comment |
Probability of retirement event Thanks, but: (a) What is $F$? (b) Why is it not possible to compute the probability exactly? Apologies for my ignorance... |
|
May
11 |
|
revised |
Probability of retirement event added 189 characters in body |
|
May
11 |
|
comment |
Probability of retirement event @HagenvonEitzen: Yes. I'll clarify. |
|
May
11 |
|
asked | Probability of retirement event |
|
May
11 |
|
comment |
How to find the tangents of two ellipses? You can actually solve this analytically, which might not be the best computational route, but ... |
|
May
7 |
|
awarded | Caucus |
|
May
5 |
|
answered | Find separating line between two polygons |
|
May
3 |
|
comment |
intersection of voronoi diagram with a line See the answers on MathOverflow, which suggest the answer is No, under certain interpretations of "comptutationally efficient." |
|
Apr
23 |
|
comment |
Creating bounds of a shape Try the *Graham scan* algorithm. You can find code for it all over the web (and via that Wikipedia link). |
|
Apr
16 |
|
answered | reference algorithm for weighted voronoi diagrams? |
|
Apr
8 |
|
comment |
farthest point voronoi diagram of 3 points @Ashwin: Adobe Illustrator. |
|
Apr
7 |
|
revised |
farthest point voronoi diagram of 3 points added 5 characters in body |
|
Apr
7 |
|
answered | farthest point voronoi diagram of 3 points |
