Share Your Experience: Take the 2024 Developer Survey

# Tag Info

Accepted

### Determine image of hypercube under linear map

I eventually found an answer. The image of a hypercube in $\Bbb R^3$ under a linear map is called a zonohedron. They can be calculated efficiently, for example using the algorithm in An Efficient ...
Accepted

### Name this optimum-within-convex-hull algorithm: State is a convex combination of hull vertices; Nonnegativity ensured by reparameterization

I don't know of any name for this. There are several algorithms, e.g. Newton trust region methods, that have convergence guarantees for convex optimization problems with linear inequality constraints. ...
• 10.3k
Accepted

### Min supporting line of a set of points

Given a set of $n$ points $\mathcal{P}$ in the 2-dimensional plane, consider the convex hull $\text{chull}(\mathcal{P}) = p_1 p_2 \dots p_h p_1$, with the boundary represented as a cycle comprised of \$...
• 4,248
Accepted

### Find the smallest convex hull that enclose an arbitrary point

It's often best to start with the simplest, easiest-to-implement algorithm you can think of to test that your intuition on a problem is correct and that what you've built will match what you need. In ...
• 3,971

### Find the smallest convex hull that enclose an arbitrary point

I don't understand the downvote, the community bot should have been smarter. Anyway, here is a very quick and dirty method. First of all, a convex hull can be discretized into triangles using its ...
• 277