Shape Fitting with Outliers
From MaRDI portal
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Numerical approximation and computational geometry (primarily algorithms) (65D99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cited in
(22)- Practical methods for shape fitting and kinetic data structures using coresets
- Optimal consensus set for digital flake hyperspheres in \(n\)D
- Expected size of random Tukey layers and convex layers
- Order-k -hulls and -shapes
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Extremal point queries with lines and line segments and related problems
- Outlier Respecting Points Approximation
- Fitting a Step Function to a Point Set
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Robust shape fitting via peeling and grating coresets
- Shape fitting with outliers
- Fitting flats to points with outliers
- Fitting a step function to a point set
- An almost space-optimal streaming algorithm for coresets in fixed dimensions
- scientific article; zbMATH DE number 7651177 (Why is no real title available?)
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- Minimum-width annulus with outliers: circular, square, and rectangular cases
- Robust shape fitting via peeling and grating coresets
- Hybrid k-clustering: blending k-median and k-center
- Hybrid k-clustering: blending k-median and k-center
- Dynamic coresets
- How to get close to the median shape
This page was built for publication: Shape Fitting with Outliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651463)
