Timeline for Boolean operation on n dimensional polyhedron
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 20, 2022 at 7:22 | comment | added | Robin Lee | @MaxAlekseyev It is in Chapter 10 of the documentation. "the union of two disjoint polyhedra is a domain consisting of two polyhedra", I also tried with a simple example using two polyhedra that have intersections, the resulting domain is a list of the two given polyhedra. Also, this library seems to only support integer matrix inputs, floating numbers are rounded. | |
| Oct 20, 2022 at 0:51 | comment | added | Max Alekseyev | @RobinLee: I don't think it's "just a list". Here is a more detailed page about this library: icps.u-strasbg.fr/polylib | |
| Oct 20, 2022 at 0:25 | comment | added | Robin Lee | @WlodAA Could you let me know which part is comfusing? | |
| Oct 20, 2022 at 0:24 | comment | added | Robin Lee | @MaxAlekseyev I took a look at this library, it can calculate the union of polyhedra, but the union is just a list of all given polyhedra, not in terms of the final shape's vertices and facets. | |
| Oct 19, 2022 at 23:20 | comment | added | Max Alekseyev | For example, doc.sagemath.org/html/en/reference/spkg/polylib.html | |
| Oct 19, 2022 at 23:19 | comment | added | Wlod AA | You need to rewrite this question. At this time, it makes no sense. | |
| Oct 19, 2022 at 23:14 | history | edited | RobPratt | CC BY-SA 4.0 |
added 2 characters in body
|
| Oct 19, 2022 at 22:40 | history | edited | LSpice | CC BY-SA 4.0 |
TeX; consistent capitalisation
|
| Oct 19, 2022 at 22:35 | history | edited | Robin Lee | CC BY-SA 4.0 |
added 376 characters in body
|
| Oct 19, 2022 at 22:30 | history | asked | Robin Lee | CC BY-SA 4.0 |