Christian Schilling
Christian Schilling
In #2753 we used a workaround to avoid a Julia error. When that error gets fixed, we should remove the code duplication again. The relevant lines are 55-64 (remove) resp....
`DiagDirections` is more or less a copy of `BoxDiagDirections`. The latter should just iterate over a `DiagDirections` and a `BoxDirections` object.
`convex_hull` expects several arguments because the most common case is the union of two or more convex sets. But since we also have non-convex sets, it makes sense to compute...
```julia julia> H = HalfSpace([-1.0, -1.0], -3.0); julia> P = VPolygon([[1.0, 1.0], [3.0, 1.0], [2.0, 3.0]]); ``` This works: ```julia julia> plot(Intersection(H, P)) julia> plot!(H) ``` This does not work:...
Given a set `X` and a point `p` (and maybe a distance function `d`), compute the minimal distance of `X` and `p`: ``` min_{x ∈ X} d(x, p) ``` For...
EDIT: This is implemented now. See [this paper](https://mediatum.ub.tum.de/doc/1287515/document.pdf) for an alternative algorithm to reduce the order of a zonotope, including heuristics.
Running `include("docs/make.jl")` (twice) prints many warnings about broken links. I checked a few of them and they work fine in the result, so maybe these are false warnings. ```julia ┌...
See #2264. I was surprised that the iterator is generally slower. It is faster if it is not exhausted, though. I checked everything and I would conclude that the additional...
Closes #2265. --- EDIT: I second-guess this changeset. #2331 made me realize that the iterator pattern in Julia creates additional allocations that makes full iteration more expensive than direct collection...
The following should work without `Polyhedra`: ```julia julia> P = rand(VPolytope); julia> P ⊆ P ERROR: AssertionError: package 'Polyhedra' not loaded (it is required for executing `default_polyhedra_backend`) Stacktrace: [1] macro...