Journal of Algorithms

Paper

01 Jan 1985

Partitioning with two lines in the plane

View publication

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

Conference paper

Algorithms and complexity analysis for some flow problems

Edith Cohen, Nimrod Megiddo

SODA 1991

Paper

An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem

Nimrod Megiddo, Eitan Zemel

Journal of Algorithms

Conference paper

Carving perfect layers out of docker images

Dimitrios Skourtis, Lukas Rupprecht, et al.

HotCloud 2019

Paper

On total functions, existence theorems and computational complexity

Nimrod Megiddo, Christos H. Papadimitriou

Theoretical Computer Science

View all publications