Back to Search
Start Over
ON COMPUTING A LARGEST EMPTY ARBITRARILY ORIENTED RECTANGLE.
- Source :
- International Journal of Computational Geometry & Applications; Jun2003, Vol. 13 Issue 3, p257, 15p, 24 Black and White Photographs, 1 Chart
- Publication Year :
- 2003
-
Abstract
- Given a set P of n points within a rectangle R, we present an O(n³) time algorithm for computing an arbitrarily oriented empty rectangle of largest area in R that is bounded by a point of P on each of its four sides. We assume that R is large enough to contain such a rectangle. [ABSTRACT FROM AUTHOR]
- Subjects :
- RECTANGLES
MATHEMATICAL optimization
ALGORITHMS
GEOMETRY
Subjects
Details
- Language :
- English
- ISSN :
- 02181959
- Volume :
- 13
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- International Journal of Computational Geometry & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 10406392
- Full Text :
- https://doi.org/10.1142/S0218195903001153