How to get close to the median shape

DOI10.1016/j.comgeo.2006.02.003zbMath1116.65026OpenAlexW2219129186MaRDI QIDQ870425

Sariel Har-Peled

Publication date: 12 March 2007

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

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

zbMATH Keywords

circlespherecylinderlinear time algorithmapproximation algorithmsshape fittingbest fitting

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

On the least trimmed squares estimator ⋮ Efficient subspace approximation algorithms ⋮ Geometric optimization and sums of algebraic functions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On range searching with semialgebraic sets
• Approximation algorithms for minimum-width annuli and shells
• Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
• Approximating extent measures of points
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• On coresets for k-means and k-median clustering
• Matrix approximation and projective clustering via volume sampling
• Finding minimal enclosing boxes
• Shape Fitting with Outliers
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Smaller coresets for k-median and k-means clustering
• Fast monte-carlo algorithms for finding low-rank approximations
• Algorithms and Computation
• Robust shape fitting via peeling and grating coresets
• Analysis of incomplete data and an intrinsic-dimension Helly theorem

This page was built for publication: How to get close to the median shape