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
Introduction to Algorithms
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
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Practical methods for shape fitting and kinetic data structures using core sets
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Adaptive sampling for geometric problems over data streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Geometric optimization problems over sliding windows
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Simplified Planar Coresets for Data Streams
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
Geometric streaming algorithms with a sorting primitive
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Proceedings of the twenty-sixth annual symposium on Computational geometry
Streaming algorithms for extent problems in high dimensions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A unified approach to approximate proximity searching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast oriented bounding box optimization on the rotation group SO(3,ℝ)
ACM Transactions on Graphics (TOG)
How to cover a point set with a V-shape of minimum width
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Width of points in the streaming model
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for number-in-hand multiparty communication complexity, made easy
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
How to cover a point set with a V-shape of minimum width
Computational Geometry: Theory and Applications
A linear time approximation scheme for computing geometric maximum k-star
Journal of Global Optimization
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We speed up previous (1+@e)-factor approximation algorithms for a number of geometric optimization problems in fixed dimensions: diameter, width, minimum-radius enclosing cylinder, minimum-width enclosing annulus, minimum-width enclosing cylindrical shell, etc. Linear time bounds were known before; we further improve the dependence of the ''constants'' in terms of @e. We next consider the data-stream model and present new (1+@e)-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.