-
EDIT: The current implementation just calls `Polyhedra`'s `convexhull` method.
An efficient implementation that does not go down to V-rep is given [here](https://cstheory.stackexchange.com/question…
-
Smallest triangle containing the box.
Largest triangle contained in the box.
Fraction of area inside for boundary triangles.
Role of resolution in defining a cover.
resolution specifies the precis…
-
## Issue Details
I have encountered a couple of errors in functions `greene_approx_convex_partition_2` and `optimal_convex_partition_2` from the 2D Polygon Partitioning package.
The functions fa…
-
API reference:
- https://docs.sympy.org/latest/modules/sets.html
- see also: https://github.com/symengine/symengine/blob/master/symengine/sets.h
sympy uses properties for many things, so we probabl…
-
Hi,
maybe i am missing something, but is it possible that there are no simple objective functions, e.g. separable with very simple pareto fronts in x-space but non-convex hypervolume sets?
an exampl…
-
Optimization based methods (those that take complements) work well for "exclusion zone" type properties but not as well when the property is f(X) \in Y for convex Y, because the complement leads to a …
-
Task item: process a partition resulting from abstraction of a continuous dynamical system to add information about how many steps are needed to reach the target polytope of an (outgoing) trajectory, …
-
```julia
b = rand(BallInf)
c = rand(Ball2)
u = UnionSet(b, c)
overapproximate(u, Hyperrectangle)
MethodError: no method matching overapproximate(::UnionSet{Float64,BallInf{Float64},Ball2{Float6…
-
Hi there :)
I want to solve many ODEs which involve a small parameterised convex QP problem as a part of evaluating the right hand side. The QP is of the standard form:
`min_x x' Q x + p' x`
…
mbjd updated
7 months ago
-
Mesh offsetting seems very useful for adding tolerance to parts, especially when combined with face selection.
~~I wonder if I can just offset each vertices according to their tangent? Although we…