Computing the extreme distances between two convex polygons
Journal of Algorithms
On the sectional area of convex polytopes
Proceedings of the twelfth annual symposium on Computational geometry
Approximation of convex figures by pairs of rectangles
Computational Geometry: Theory and Applications
Approximation of Convex Polygons
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Faster core-set constructions and data stream algorithms in fixed dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximating extent measures of points
Journal of the ACM (JACM)
Tentative Prune-And-Search For Computing Fixed-Points With Applications To Geometric Computation
Fundamenta Informaticae
Geometric optimization and sums of algebraic functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Querying Approximate Shortest Paths in Anisotropic Regions
SIAM Journal on Computing
Stacking and bundling two convex polygons
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Largest inscribed rectangles in convex polygons
Journal of Discrete Algorithms
Geometric optimization and sums of algebraic functions
ACM Transactions on Algorithms (TALG)
Overlap of convex polytopes under rigid motion
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Given a planar convex set C, we give sublinear approximation algorithms to determine approximations of the largest axially symmetric convex set S contained in C, and the smallest such set S^' that contains C. More precisely, for any @?0, we find an axially symmetric convex polygon Q@?C with area |Q|(1-@?)|S| and we find an axially symmetric convex polygon Q^' containing C with area |Q^'|