𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic Connectivity for Axis-Parallel Rectangles

✍ Scribed by Peyman Afshani; Timothy M. Chan


Book ID
106148961
Publisher
Springer
Year
2008
Tongue
English
Weight
328 KB
Volume
53
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Enclosing k points in the smallest axis
✍ Michael Segal; Klara Kedem πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 445 KB

We consider the following clustering problem. Given a set S of II points in the plane, and given an integer k, n/2 < k < n, we want to find the smallest axis parallel rectangle (smallest perimeter or area) that encloses exactly k points of S. We present an algorithm which runs in time 0( n + k( n -k