Timeline for Largest ball with fixed center in a a convex region
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 2, 2015 at 6:27 | comment | added | John Gunnar Carlsson | This is a borderline useless comment, but if you're willing to consider a "ball" in the $\ell_1$ sense, then all you'd have to do is check each of its $2d$ vertices, which would enable you to just do a simple bisection search on the "radius" and treat $f$ as a black box. | |
| Apr 1, 2015 at 20:35 | comment | added | Joseph O'Rourke | I think Alex's point is that your question cannot be answered without a description of how $C$ is given. As a semi-algebraic set? | |
| Apr 1, 2015 at 19:13 | comment | added | Gerhard Paseman | Try a coordinate system change: move $x_0$ to the origin and then use spherical coordinates. See if you can use some analysis to find an optimal r. Gerhard "Maybe Cylindrical Coordinates Will Work" Paseman, 2015.04.01 | |
| Apr 1, 2015 at 17:41 | history | edited | Tom Solberg | CC BY-SA 3.0 |
added a characterization of $C$ pursuant to Alex's comment
|
| Apr 1, 2015 at 17:40 | comment | added | Tom Solberg | Let's say it's the sub-level set of a convex function, $\{x:f(x)\leq 0\}$? Just edited the problem. | |
| Apr 1, 2015 at 17:35 | comment | added | Alex Degtyarev | I think the computer tractability question would mainly depend on how $C$ is given. Do you have any "computer readable" representation in mind? | |
| Apr 1, 2015 at 17:31 | review | First posts | |||
| Apr 1, 2015 at 17:35 | |||||
| Apr 1, 2015 at 17:30 | history | asked | Tom Solberg | CC BY-SA 3.0 |