High-dimensional shape fitting in linear time

DOI10.1145/777792.777799zbMATH Open1375.68146OpenAlexW2170552495MaRDI QIDQ5361602FDOQ5361602

Authors: Sariel Har-Peled, Kasturi Varadarajan 

Publication date: 29 September 2017

Published in: Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/777792.777799

Recommendations

• High-dimensional shape fitting in linear time
• Projective clustering in high dimensions using core-sets
• Efficient subspace approximation algorithms
• Fitting flats to points with outliers
• Shape fitting with outliers

zbMATH Keywords

computational convexityprojective clustering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cited In (10)

• High-dimensional shape fitting in linear time
• Title not available (Why is that?)
• The number of cylindrical shells
• Shape fitting with outliers
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• How to get close to the median shape
• Projective clustering in high dimensions using core-sets
• An improved algorithm for approximating the radii of point sets
• Fitting flats to points with outliers
• Shape Fitting with Outliers

This page was built for publication: High-dimensional shape fitting in linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361602)