Enclosing a Set of Objects by Two Minimu
β
Bruno Becker; Paolo Giulio Franciosa; Stephan Gschwind; Stefano Leonardi; Thomas
π
Article
π
1996
π
Elsevier Science
π
English
β 737 KB
In this paper, we face the problem of computing an enclosing pair of axis-parallel rectangles of a set of polygonal objects in the plane, serving as a simple container. Ε½ Ε½ . . Ε½ . We propose an O nβ£ n log n worst-case time algorithm, where β£ is the inverse Ackermann's function, for finding, given a