Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

Let S be a set of n points in a fixed axis-parallel rectangle $R\subseteq \Re^{2}$, i.e. in the two-dimensional space (2D… Expand

Highly Cited

2005

Highly Cited

2005

A rectangleA and a setS ofn points inA are given. We present a new simple algorithm for the so-called largest empty rectangle… Expand

2003

2003

This work generalizes the classical problem of finding the largest empty rectangle among obstacles in 2D. Given a set P of n… Expand

1999

1999

This paper generalizes the classical MER problem in 2D. Given a set P of n points, here a maximal empty rectangle (MER) is… Expand

1994

1994

This paper outlines the following generalization of the classical maximal-empty-rectangle (MER) problem: given n arbitrarily… Expand

1990

1990

Abstract Given a rectangle R (with its edges parallel to the coordinate axes) containing a set S = { s 1 ,…, s n } of n points in… Expand

Highly Cited

1987

Highly Cited

1987

We provide two algorithms for solving the following problem: Given a rectangle containing <italic>n</italic> points, compute the… Expand

1987

1987

Suppose we are given a two-dimensional rectangular surface upon which is placed a grating of size n by m square elements. The (n… Expand

Highly Cited

1986

Highly Cited

1986

We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel… Expand

Highly Cited

1984

Highly Cited

1984

We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel… Expand