Solutions to the Minimum Variance Problem Using Delaunay Triangulation
From MaRDI portal
Publication:5139666
DOI10.1137/19M1301837zbMath1454.62223MaRDI QIDQ5139666
Publication date: 10 December 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Analysis of variance and covariance (ANOVA) (62J10) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stochastic analysis of first-order reaction networks
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\)
- Barycentric coordinates for convex polytopes
- Triangulations. Structures for algorithms and applications
- Triangulations for the cube
- Triangulations and simplicial methods
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs
- Delaunay simplices in diagonally distorted lattices
- A comparison of sequential Delaunay triangulation algorithms.
- Triangulations and applications
- Simplizialzerlegungen von beschränkter Flachheit
- Delaunay Mesh Generation
- Matrix Analysis
- On aggregated Markov processes
- Improving the convergence of fixed-point algorithms
- Stochastic Analysis of Biochemical Systems
