Timeline for Bounding distance to an intersection of polyhedra
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10 at 15:01 | vote | accept | Anton Kapustin | ||
| Feb 10 at 14:42 | answer | added | Fedor Petrov | timeline score: 5 | |
| Feb 10 at 2:11 | review | Close votes | |||
| Feb 14 at 3:11 | |||||
| Feb 9 at 23:59 | comment | added | Joseph O'Rourke | Suppose $P \subset Q$ so that $P \cap Q=P$. Let $x^*$ be a point on $P$ one end of which realizes the diameter of $P$. Then it seems your inequality says that $d(x,P) \le \max( d(x,P))=d(x^*,P)$, so $C_{PQ} = 1$. | |
| Feb 9 at 23:31 | history | edited | Sam Hopkins | CC BY-SA 4.0 |
deleted 69 characters in body
|
| Feb 9 at 23:29 | history | edited | Anton Kapustin | CC BY-SA 4.0 |
added 135 characters in body
|
| Feb 9 at 23:04 | history | asked | Anton Kapustin | CC BY-SA 4.0 |