This paper generalizes the classical MER problem in 2D. Given a set P of n points, here a maximal empty rectangle (MER) is defined as a rectangle of arbitrary orientation such that each of its four sides coincides with at least one member of P and the interior of the rectangle is empty. We propose a simple algorithm based on standard data structure to locate largest area MER on the floor. The time and space complexities of our algorithm are O(n ³) and O(n ²) respectively.