Computational geometry: an introduction
Computational geometry: an introduction
Fast approximation algorithms for a nonconvex covering problem
Journal of Algorithms
Discrete Mathematics
Parallel computational geometry
Parallel computational geometry
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the twelfth annual symposium on Computational geometry
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A polynomial time solution for labeling a rectilinear map
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
A practical map labeling algorithm
Computational Geometry: Theory and Applications
Map labeling and its generalizations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Data Structures for Fat Objects and Their Applications
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Fast Stabbing of Boxes in High Dimensions
Proceedings of the 8th Canadian Conference on Computational Geometry
Approximating Dense Cases of Covering Problems
Approximating Dense Cases of Covering Problems
On Point Covers of Multiple Intervals and Axis-Parallel Rectangles
On Point Covers of Multiple Intervals and Axis-Parallel Rectangles
| Hi-index | 5.23 |
Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2, i.e., bounded intersection of halfplanes whose normal directions of edges belong to a fixed collection of c distinct directions. Let (S) denote the packing number of S, that is the maximum number of pairwise disjoint objects of S. Let (S) be the transversal number of S, that is the minimum number of points required so that each object contains at least one of those points. We provide linear-time algorithms t(n, c) = &Thgr;(nc) for &agr;-fat c-oriented polytopes, translates or homothets of Ed proving that G(2, c) = O(&agr;)d, G(2, c)≤dd and G(2, c)≤(3d3/2)d respectively