Practical methods for shape fitting and kinetic data structures using coresets (Q1006384): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for minimum-width annuli and shells
+Normal rank
@@ Property / cites work @@
+Line transversals of balls and smallest enclosing cylinders in three dimensions
+Normal rank
@@ Property / cites work @@
+Exact and approximation algorithms for minimum-width cylindrical shells
+Normal rank
@@ Property / cites work @@
+Maintaining the extent of a moving point set
@@ Property / cites work: Maintaining the extent of a moving point set / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating extent measures of points
@@ Property / cites work: Approximating extent measures of points / rank @@
+Normal rank
@@ Property / cites work @@
+Q5290249
@@ Property / cites work: Q5290249 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for a \(k\)-line center
@@ Property / cites work: Approximation algorithms for a \(k\)-line center / rank @@
+Normal rank
@@ Property / cites work @@
+Space-efficient approximate Voronoi diagrams
@@ Property / cites work: Space-efficient approximate Voronoi diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for approximate nearest neighbor searching fixed dimensions
+Normal rank
@@ Property / cites work @@
+Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
+Normal rank
@@ Property / cites work @@
+Data Structures for Mobile Data
@@ Property / cites work: Data Structures for Mobile Data / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471374
@@ Property / cites work: Q4471374 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate clustering via core-sets
@@ Property / cites work: Approximate clustering via core-sets / rank @@
+Normal rank
@@ Property / cites work @@
+APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
+Normal rank
@@ Property / cites work @@
+Faster core-set constructions and data-stream algorithms in fixed dimensions
+Normal rank
@@ Property / cites work @@
+Las Vegas algorithms for linear and integer programming when the dimension is small
+Normal rank
@@ Property / cites work @@
+Applications of random sampling in computational geometry. II
+Normal rank
@@ Property / cites work @@
+A Subexponential Algorithm for Abstract Optimization Problems
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+A practical approach for computing the diameter of a point set
+Normal rank
@@ Property / cites work @@
+Smaller coresets for \(k\)-median and \(k\)-means clustering
+Normal rank
@@ Property / cites work @@
+On coresets for k-means and k-median clustering
@@ Property / cites work: On coresets for k-means and k-median clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Shape Fitting with Outliers
@@ Property / cites work: Shape Fitting with Outliers / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate minimum enclosing balls in high dimensions using core-sets
+Normal rank
@@ Property / cites work @@
+Minimum-volume enclosing ellipsoids and core sets
@@ Property / cites work: Minimum-volume enclosing ellipsoids and core sets / rank @@
+Normal rank
@@ Property / cites work @@
+Space-time tradeoffs for approximate nearest neighbor searching
+Normal rank
@@ Property / cites work @@
+On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems
+Normal rank
@@ Property / cites work @@
+Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
+Normal rank