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

Fast algorithms for finding randomized strategies in game trees

Daphne Keller, Nimrod Megiddo, et al.

STOC 1994

Conference paper

A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension

Miklos Ajtai, Nimrod Megiddo

STOC 1992

Paper

On orientations and shortest paths

Rafael Hassin, Nimrod Megiddo

Linear Algebra and Its Applications

Paper

Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs

Edith Cohen, Nimrod Megiddo

Journal of the ACM (JACM)

View all publications