-
Visually, there is no different between the two plots:
```
p = Polyhedron(rays=[(0, 0, 1)],lines=[(1, 0, 0), (0, 1, 0)])
p.plot()
q = Polyhedron(lines=[(1, 0, 0), (0, 1, 0)])
q.plot()
```
The bug s…
-
Julia throws an error when I try to get the constraints of a vrep polytope (using the `LazySets.jl` interface); looks like a bug in the `Polyhedra.jl` implementation?
```julia
julia> rpoly
VPolyt…
-
The Parma Polyhedra Library (ppl) is for many workloads the fastest library for polyhedral computations. It is also high-quality code, for example GCC uses it (optionally) to optimize loops.
* ppl …
-
Tarballs: see checksums.ini
These new releases include dynamic bitset classes that allow dynamic h-representation computations.
We also install nauty header and library in order that Normaliz comp…
-
Similar to #694, I'm running into the error:
```python
ax.service.managed_loop: Running optimization trial 1... [INFO 12-04 17:51:23] ax.service.managed_loop: Stopped
optimization as the search …
-
It's work with a small(5 for example) number of parameters in the "parameter_constraints" option. But if the number of parameters for example 10, there is the error.
In my case "parameter_constraints…
-
This is a list of some issues with the current implementation that need to be straightened out. In particular, the `Cone` and `Polyhedron` interfaces need to be unified. Some of these issues might alr…
-
In polymake everything is homogeneous and polytopes are treated internally as cones most of the time where the actual polytope sits at height one. I.e. we have the coordinates `[height, x_1, x_2, ...]…
-
greedy algorithm checks candidate vertices against all vertices already in "keep" list for overlap; this scales as *O(n^2)* with the number of vertices in the tesselation.
can the checks for candid…
-
I'd like to expand our database of small regular-ish things. Here are a few near-term goals:
1. Incorporate Marston's and/or Primoz's data on small chiral polyhedra and/or maps. (This has #11 as a pr…