Computational geometry: an introduction
Computational geometry: an introduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
On Some Geometric Selection and Optimization Problems via Sorted Matrices
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Approximation Algorithms for k-Line Center
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Tentative Prune-And-Search For Computing Fixed-Points With Applications To Geometric Computation
Fundamenta Informaticae
Analysis of incomplete data and an intrinsic-dimension Helly theorem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition
ACM Transactions on Algorithms (TALG)
Locating Objects in the Plane Using Global Optimization Techniques
Mathematics of Operations Research
Clustering lines in high-dimensional space: Classification of incomplete data
ACM Transactions on Algorithms (TALG)
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
How to cover a point set with a V-shape of minimum width
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We consider the following instance of projective clustering, known as the 2-line-center problem: Given a set S of n points in R2, cover S by two congruent strips of minimum width. Algorithms that find the optimal solution for this problem have near-quadratic running time. In this paper we present an algorithm that, for any ε 0, computes in time O(n(logn + ε-2 log(1/ε)) + ε-7/2 log(1/ε)) a cover of S by two strips of width at most (1 + ε)w*.