Timeline for Divide a geometric region by (many) lines
Current License: CC BY-SA 4.0
33 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23 at 15:35 | history | edited | cvgmt | CC BY-SA 4.0 |
deleted 79 characters in body
|
| Feb 23 at 13:47 | history | edited | cvgmt | CC BY-SA 4.0 |
added 1 character in body
|
| Feb 23 at 13:38 | history | edited | cvgmt | CC BY-SA 4.0 |
added 4 characters in body
|
| Feb 23 at 13:32 | history | edited | cvgmt | CC BY-SA 4.0 |
added 1621 characters in body
|
| Feb 23 at 13:27 | history | edited | cvgmt | CC BY-SA 4.0 |
added 1621 characters in body
|
| Feb 23 at 4:18 | history | edited | cvgmt | CC BY-SA 4.0 |
deleted 28 characters in body
|
| Feb 23 at 2:12 | history | edited | cvgmt | CC BY-SA 4.0 |
added 92 characters in body
|
| Feb 23 at 2:01 | history | edited | cvgmt | CC BY-SA 4.0 |
added 1006 characters in body
|
| May 3, 2022 at 19:30 | comment | added | kirma |
PolygonDecomposition seems like a hidden gem similarly to CylindricalDecomposition with the somewhat recently introduced topological operations. Too bad it doesn't extend to higher dimensions though...
|
|
| Apr 30, 2022 at 10:18 | history | edited | cvgmt | CC BY-SA 4.0 |
added 12 characters in body
|
| Apr 30, 2022 at 0:49 | history | edited | cvgmt | CC BY-SA 4.0 |
added 15 characters in body
|
| Apr 30, 2022 at 0:25 | history | edited | cvgmt | CC BY-SA 4.0 |
added 69 characters in body
|
| Apr 30, 2022 at 0:12 | history | edited | cvgmt | CC BY-SA 4.0 |
added 591 characters in body
|
| Apr 30, 2022 at 0:07 | history | edited | cvgmt | CC BY-SA 4.0 |
added 591 characters in body
|
| Apr 28, 2022 at 6:39 | history | edited | cvgmt | CC BY-SA 4.0 |
edited body
|
| Apr 28, 2022 at 6:09 | history | edited | cvgmt | CC BY-SA 4.0 |
added 43 characters in body
|
| Apr 27, 2022 at 4:11 | history | edited | cvgmt | CC BY-SA 4.0 |
added 616 characters in body
|
| Apr 26, 2022 at 23:03 | history | edited | cvgmt | CC BY-SA 4.0 |
added 310 characters in body
|
| Apr 26, 2022 at 22:42 | comment | added | cvgmt | @kirma Thanks your code. | |
| Apr 26, 2022 at 15:36 | comment | added | kirma |
For images you can do two-colour plot like this: Fold[ImageDifference, ParallelTable[RegionImage[HalfSpace[RandomReal[{-1, 1}, 2], RandomPoint@Circle[]], {{-1, 1}, {-1, 1}}], {100}]]
|
|
| Apr 26, 2022 at 15:14 | history | edited | cvgmt | CC BY-SA 4.0 |
added 245 characters in body
|
| Apr 24, 2022 at 10:35 | history | edited | cvgmt | CC BY-SA 4.0 |
edited body
|
| Apr 24, 2022 at 10:28 | history | edited | cvgmt | CC BY-SA 4.0 |
added 48 characters in body
|
| Apr 24, 2022 at 10:12 | history | edited | cvgmt | CC BY-SA 4.0 |
deleted 1 character in body
|
| Apr 22, 2022 at 1:38 | comment | added | cvgmt |
@Taozi You are right. We can adjust the AbsoluteThickness[1] to make the lines thin and then we can seperate the regions although there many lines.
|
|
| Apr 22, 2022 at 1:26 | history | edited | cvgmt | CC BY-SA 4.0 |
added 40 characters in body
|
| Apr 22, 2022 at 1:20 | comment | added | Taozi | If I understand correctly, the (vector) image containing the random lines is rasterized first, the result is then subject to connected component analysis. Due to the finite resolution introduced by the rasterization, the approach only works for a few lines--unless the image is made huge? | |
| Apr 22, 2022 at 1:08 | history | edited | cvgmt | CC BY-SA 4.0 |
deleted 77 characters in body
|
| Apr 22, 2022 at 0:38 | history | edited | cvgmt | CC BY-SA 4.0 |
deleted 4 characters in body
|
| Apr 21, 2022 at 23:22 | history | edited | cvgmt | CC BY-SA 4.0 |
added 118 characters in body
|
| Apr 21, 2022 at 23:16 | history | edited | cvgmt | CC BY-SA 4.0 |
added 15 characters in body
|
| Apr 21, 2022 at 23:08 | history | edited | cvgmt | CC BY-SA 4.0 |
added 2 characters in body
|
| Apr 21, 2022 at 23:02 | history | answered | cvgmt | CC BY-SA 4.0 |