ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

A new algorithm for the largest empty rectangle problem (1990)

Orlowski, M.

Springer

Algorithmica 5 (1990), S. 65-73

add to mindlist on the mindlist

Details

ISSN: 1432-0541

Keywords: Computational geometry ; Algorithms ; Computational complexity ; Largest empty rectangle problem

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract A rectangleA and a setS ofn points inA are given. We present a new simple algorithm for the so-called largest empty rectangle problem, i.e., the problem of finding a maximum area rectangle contained inA and not containing any point ofS in its interior. The computational complexity of the presented algorithm isO(n logn + s), where s is the number of possible restricted rectangles considered. Moreover, the expected performance isO(n · logn).

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01840377

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit