Timeline for Optimal intersections between planar convex regions
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13, 2022 at 10:41 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 162 characters in body
|
| May 30, 2022 at 17:17 | history | edited | Nandakumar R | CC BY-SA 4.0 |
Slightly weakened the claim given in question 2
|
| May 27, 2022 at 3:45 | history | edited | Daniele Tampieri | CC BY-SA 4.0 |
Math Jaxed
|
| May 27, 2022 at 3:38 | comment | added | Nandakumar R | Thank you for pointing out that it is desirable to specify the transformations used to achieve max intersection. Added that to the question. | |
| May 27, 2022 at 3:37 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 183 characters in body
|
| May 17, 2022 at 22:34 | comment | added | Joseph O'Rourke | This is close to what you seek, restricted to translation-only: Har-Peled, Sariel, and Subhro Roy. "Approximating the maximum overlap of polygons under translation." Algorithmica 78, no. 1 (2017): 147-165. arXiv. "We present an $(1 − \varepsilon)$-approximation algorithm, for finding the translation of $q$, which maximizes its area of overlap with $P$." | |
| Mar 18, 2022 at 5:27 | review | Close votes | |||
| Apr 2, 2022 at 3:00 | |||||
| Mar 17, 2022 at 17:33 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 171 characters in body
|
| Mar 17, 2022 at 9:55 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 502 characters in body
|
| Jan 24, 2022 at 15:57 | history | edited | user44143 | CC BY-SA 4.0 |
simplified sentences, added hyphens
|
| Jan 24, 2022 at 13:51 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title
|
| Jan 24, 2022 at 10:25 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 243 characters in body
|
| Jan 5, 2022 at 4:27 | review | Close votes | |||
| Feb 2, 2022 at 3:03 | |||||
| Jan 4, 2022 at 18:43 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 101 characters in body
|
| Jan 4, 2022 at 17:26 | history | asked | Nandakumar R | CC BY-SA 4.0 |