Skip to main content

3 Result(s)

within English Remove this filter Mathematics Remove this filter Nimrod Megiddo Remove this filter

and
Your search also matched 21 preview-only Content is preview-only when you or your institution have not yet subscribed to it.

By making our abstracts and previews universally accessible we help you purchase only the content that is relevant to you. results, e.g.

The kernel and the nucleolus of a product of simple games

Include preview-only content

  1. Article

    Computing circular separability

    Two sets of planar pointsS 1 andS 2 are circularly separable if there is a circle that enclosesS 1 but excludesS 2. We show that deciding whether two sets are circularly separable can be accomplished inO(n) time ...

    Joseph O'Rourke, S. Rao Kosaraju, Nimrod Megiddo in Discrete & Computational Geometry (1986)

    Download PDF (504 KB)

  2. Article

    On the complexity of polyhedral separability

    It is NP-complete to recognize whether two sets of points in general space can be separated by two hyperplanes. It is NP-complete to recognize whether two sets of points in the plane can be separated withk lines....

    Nimrod Megiddo in Discrete & Computational Geometry (1988)

    Download PDF (745 KB)

  3. Article

    On the ball spanned by balls

    The procedure for linear programming in linear time in fixed dimension is extended to solve in linear time certain nonlinear problems. Examples are the problem of finding the smallest ball enclosingn given balls,...

    Nimrod Megiddo in Discrete & Computational Geometry (1989)

    Download PDF (277 KB)