Nimrod Megiddo
Discrete and Computational Geometry
Paper
Partitioning with two lines in the plane
Abstract
An O(n) algorithm is presented for the problem of partitioning a set of n points in the plane into four equal parts by means of two straight lines. © 1985.
Related
Nimrod Megiddo, Arie Tamir
Operations Research Letters
Conference paper
ArC: A self-tuning, low overhead replacement cache
Nimrod Megiddo, Dharmendra S. Modha
FAST 2003
Tomás Feder, Nimrod Megiddo, et al.
Theoretical Computer Science