Farthest neighbors, maximum spanning trees and related problems in higher dimensions
Computational Geometry: Theory and Applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Maintaining approximate extent measures of moving points
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Approximate clustering via core-sets
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Space-efficient approximate Voronoi diagrams
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Linear Time Euclidean Distance Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Penetration depth of two convex polytopes in 3D
Nordic Journal of Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
High-dimensional shape fitting in linear time
Proceedings of the nineteenth annual symposium on Computational geometry
A Replacement for Voronoi Diagrams of Near Linear Size
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
SIAM Journal on Computing
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Sampling in dynamic data streams and applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Multi-pass geometric algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Robust shape fitting via peeling and grating coresets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A fast k-means implementation using coresets
Proceedings of the twenty-second annual symposium on Computational geometry
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
Computational Geometry: Theory and Applications
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Discrete Applied Mathematics
Adaptive sampling for geometric problems over data streams
Computational Geometry: Theory and Applications
Summarizing spatial data streams using ClusterHulls
Journal of Experimental Algorithmics (JEA)
Proceedings of the forty-first annual ACM symposium on Theory of computing
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
Computational Geometry: Theory and Applications
Approximate weighted farthest neighbors and minimum dilation stars
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Toward a Robust Search Method for the Protein-Drug Docking Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Contour approximation in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Geometric optimization problems over sliding windows
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Streaming algorithms for geometric problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Scandinavian thins on top of cake: on the smallest one-size-fits-all box
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
approximate range searching: the absolute model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We speed up previous (1+ε)-factor approximation algorithms for a number of geometric optimization problems in fixed dimensions: diameter, width, minimum-radius enclosing cylinder, minimum-width annulus, minimum-volume bounding box, minimum-width cylindrical shell, etc. Linear time bounds were known before we further improve the dependence of the "constants" in terms of ε.We next consider the data stream model and present new (1+ε)-factor approximation algorithms that need only constant space for all of the above problems in any fixed dimension. Previously, such a result was known only for diameter.Both sets of results are obtained using the core-set framework recently proposed by Agarwal, Har-Peled, and Varadarajan.