2016/02/22 by Kerrek Stinson, David F. Gleich, Stinson, Kerrek +3 · 1 citation
Computer Science · #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Data Management and Algorithms #Digital Image Processing Techniques #FOS: Mathematics #Numerical Analysis (math.NA)
paper · pdf · doi:10.48550/arxiv.1602.06620
openalex publication_date 2016/02/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a randomized algorithm for enumerating the vertices of a zonotope, which is a low-dimensional linear projection of a hypercube. The algorithm produces a pair of the zonotope's vertices by sampling a random linear combination of the zonotope generators, where the combination's weights are the signs of the product between the zonotope's generator matrix and random vectors with normally distributed entries. We study the probability of recovering particular vertices and relate it to the vertices' normal cones. This study shows that if we terminate the randomized algorithm before all vertices are recovered, then the convex hull of the resulting vertex set approximates the zonotope. In high dimensions, we expect the enumeration algorithm to be most appropriate as an approximation algorithm---particularly for cases when existing methods are not practical.