| | |
- convex_hull = convex_hull_LP_serial(A, exact=False)
- Compute the convex hull of a point set A with LPs.
In contrast to convex_hull_LP() this function works in a single thread.
Call:
indices = convex_hull_LP_serial(A)
Input:
A: an (`m` x `n`)-matrix of non-negative integers
Output:
indices: list of indices, telling which columns of A form the convex hull
- convex_hull_LP(A)
- Compute the convex hull of a point set A with LPs.
This function calls a new thread for each point, which creates a large overhead.
Call:
indices = convex_hull_LP(A)
Input:
A: an (`m` x `n`)-matrix of non-negative integers
Output:
indices: list of indices, telling which columns of A form the convex hull
- convex_hull_LP_serial(A, exact=False)
- Compute the convex hull of a point set A with LPs.
In contrast to convex_hull_LP() this function works in a single thread.
Call:
indices = convex_hull_LP_serial(A)
Input:
A: an (`m` x `n`)-matrix of non-negative integers
Output:
indices: list of indices, telling which columns of A form the convex hull
- dwarfed_cube(n, scale=2)
- Return the vertices of a scaled dwarved cube in given dimension.
- faces(A)
- interior(A, strict=True)
- interior_points(A, strict=True)
- Compute and list all interior points of the polytope given by matrix A.
- is_in_convex_hull(arg)
- Check whether v lies in the convex hull of point set A, using scipy.
- is_in_convex_hull_cvxpy(arg, exact=False)
- Check whether v lies in the convex hull of point set A, using cvxpy.
- number_interior_points(A, strict=True)
- Compute number of interior points of the polytope given by matrix A.
- reduce_to_simplex(A, lamb_base)
|