-
It would be cool to have a function that given e.g. some smooth reflexive lattice polytope identifies the unique lattice isomorphic representative in the database.
For smooth reflexive this should be …
-
cc @[ariostas](https://github.com/ariostas)
(Maybe we could even go beyond dimension 3,4,5?)
-
I plan to add code for Minkowski Decomposition of Polytopes
based on the algorithm in "On the space of Minkowski summands of a convex polytope" [http://www.eurocg2016.usi.ch/sites/default/files/pape…
-
Dear Developers and Users,
I have noticed different behaviors between the `intersect` and `&` operations when applied to a `pc.Region` and a pc.Polytope. Let’s say R is a `pc.Region` contains 11…
-
Regular polytopes A curious topological result in euclidean spaces is the number of possible regular polytopes in n dimensions. The series (starting with dimension 0) goes like this:
1 1 ∞ 5 6 3 3 3…
-
This patch introduces the following functions-
```
CanonicalFano SmoothFano
ReflexiveFano TerminalFano
PolytopeSmallPolygon lReflexive
LDP
```
These …
-
When the symmetry group propetry is used on certain polytopes, Miratope will return symmetry order 0 even though the minimum size of a symmetry group should be at least 1.
The .off in this zip file…
-
Hi everyone,
I have a quick question: Does the `reduce` function, responsible for removing redundant inequalities from the H-rep, indirectly removes overlapping polytopes (if there are any?)
The…
-
In my application domain, convex polytopes are defined by not only inequalities but also equality constraints (e.g. `x = y`). When I run `sample_points` on such convex polytopes, I get unsatisfactory …
-
Having #25097 at hand, we can now look at more complicated constructions of polytopes.
Perles and Grünbaum gave examples using Gale diagrams, see Section 5.4 of *Convex polytopes* of Grünbaum and …