Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Finding the largest area axis-parallel rectangle in a polygon
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Largest empty rectangle among a point set
Journal of Algorithms
Finding large sticks and potatoes in polygons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a randomized algorithm that computes an inscribed rectangle with area at least (1-@e) times the optimum with probability t in time O(1@elogn) for any constant t