On approximating the Riemannian 1-center

DOI10.1016/j.comgeo.2012.04.007zbMath1259.65036OpenAlexW2164118370WikidataQ115358493 ScholiaQ115358493MaRDI QIDQ714906

Marc Arnaudon, Frank Nielsen

Publication date: 12 October 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.04.007

zbMATH Keywords

algorithmRiemannian geometrycomputational geometry1-centercore-setfinite Euclidean point setminimax centersmallest enclosing ball

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Methods of local Riemannian geometry (53B21)

Related Items (12)

Mumford-Shah and Potts regularization for manifold-valued data ⋮ ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE ⋮ A stochastic algorithm finding generalized means on compact manifolds ⋮ Non-smooth Variational Regularization for Processing Manifold-Valued Data ⋮ Averaging Symmetric Positive-Definite Matrices ⋮ Geometric Matrix Midranges ⋮ On a minimum enclosing ball of a collection of linear subspaces ⋮ Riemannian \(L^p\) averaging on Lie group of nonzero quaternions ⋮ Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices ⋮ A numerical framework for elastic surface matching, comparison, and interpolation ⋮ Classification in the Siegel space for vectorial autoregressive data ⋮ Wald space for phylogenetic trees

This page was built for publication: On approximating the Riemannian 1-center