Minkowski-type theorems and least-squares clustering
From MaRDI portal
Publication:1386354
DOI10.1007/PL00009187zbMath0895.68135OpenAlexW2049106345MaRDI QIDQ1386354
Publication date: 24 May 1998
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009187
Related Items (56)
Shadow prices in territory division ⋮ Multivariate ranks and quantiles using optimal transport: consistency, rates and nonparametric testing ⋮ Minimum-cost load-balancing partitions ⋮ Discretization of the 3d monge−ampere operator, between wide stencils and power diagrams ⋮ Area-preserving mesh parameterization for poly-annulus surfaces based on optimal mass transportation ⋮ Measure partitions using hyperplanes with fixed directions ⋮ Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems ⋮ Scaling algorithms for unbalanced optimal transport problems ⋮ Far-field reflector problem and intersection of paraboloids ⋮ Asymptotics for Semidiscrete Entropic Optimal Transport ⋮ Rates of Convergence in $W^2_p$-Norm for the Monge--Ampère Equation ⋮ Semidual Regularized Optimal Transport ⋮ A survey of mass partitions ⋮ Optimally solving a transportation problem using Voronoi diagrams ⋮ Reprint of: Optimally solving a transportation problem using Voronoi diagrams ⋮ Semi-discrete optimal transport: hardness, regularization and numerical solution ⋮ Power diagram detection with applications to information elicitation ⋮ The second boundary value problem for a discrete Monge-Ampère equation ⋮ On soft power diagrams ⋮ The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation ⋮ An LP-based \(k\)-means algorithm for balancing weighted point sets ⋮ Constrained clustering via diagrams: a unified theory and its application to electoral district design ⋮ Unnamed Item ⋮ Accelerating surface remeshing through GPU-based computation of the restricted tangent face ⋮ Optimal Transport Approximation of 2-Dimensional Measures ⋮ Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case ⋮ Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure ⋮ Convex equipartitions: the spicy chicken theorem ⋮ Geometric clustering for the consolidation of farmland and woodland ⋮ Convergence Framework for the Second Boundary Value Problem for the Monge--Ampère Equation ⋮ Convergence rates for discretized Monge-Ampère equations and quantitative stability of optimal transport ⋮ A Lagrangian scheme à la Brenier for the incompressible Euler equations ⋮ Unnamed Item ⋮ Optimal transport: discretization and algorithms ⋮ Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials ⋮ COMONOTONIC MEASURES OF MULTIVARIATE RISKS ⋮ Asymptotic optimality of the triangular lattice for a class of optimal location problems ⋮ A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees ⋮ Optimality of the triangular lattice for a particle system with Wasserstein interaction ⋮ Using combinatorial optimization in model-based trimmed clustering with cardinality constraints ⋮ Worst case portfolio vectors and diversification effects ⋮ Weighted skeletons and fixed-share decomposition ⋮ Weighted Triangulations for Geometry Processing ⋮ Convex equipartitions via equivariant obstruction theory ⋮ A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer ⋮ An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud ⋮ Power particles ⋮ Geometric Self-Assembly of Rigid Shapes: A Simple Voronoi Approach ⋮ Good Clusterings Have Large Volume ⋮ Discretization of Euler's equations using optimal transport: Cauchy and boundary value problems ⋮ A Texture Synthesis Model Based on Semi-Discrete Optimal Transport in Patch Space ⋮ Convergence of a Newton algorithm for semi-discrete optimal transport ⋮ BALANCED CONVEX PARTITIONS OF MEASURES IN ℝ d ⋮ Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport ⋮ Unnamed Item ⋮ Discrete optimal transport: complexity, geometry and applications
This page was built for publication: Minkowski-type theorems and least-squares clustering
