Timeline for Bounding distance to a polyhedron
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9 at 5:12 | vote | accept | Anton Kapustin | ||
| Feb 8 at 22:57 | comment | added | Fedor Petrov | The last statement: Choose coordinates so that $v$ is an origin. Then the distance to $v$ does not exceed the sum of absolute values of coordinates, and each coordinate function is a linear combination of the (signed) distances to our $m$ planes with fixed coefficients. | |
| Feb 8 at 22:41 | comment | added | Anton Kapustin | Yes, but the last statement still needs a proof, see below. | |
| Feb 8 at 15:55 | comment | added | Fedor Petrov | @VladPatryshev I do not understand, sorry | |
| Feb 8 at 14:03 | comment | added | Vlad Patryshev | Not only that, but also have to walk through all the nodes. | |
| Feb 8 at 13:40 | history | answered | Fedor Petrov | CC BY-SA 4.0 |