## Bisectors of linearly separable sets

- Lee R. Nackman
- Vijay Srinivasan

- 2007
- Discrete and Computational Geometry

This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. We’re currently adding our back catalog of more than 110,000 publications. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.

13 results at Discrete and Computational Geometry

## Bisectors of linearly separable sets

- Lee R. Nackman
- Vijay Srinivasan

- 2007
- Discrete and Computational Geometry

## How to cut pseudoparabolas into segments

- Hisao Tamaki
- Takeshi Tokuyama

- 1998
- Discrete and Computational Geometry

## Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets

- T. Akutsu
- H. Tamaki
- et al.

- 1998
- Discrete and Computational Geometry

## Upper bounds for the diameter and height of graphs of convex polyhedra

- Gil Kalai

- 1992
- Discrete and Computational Geometry

## On the ball spanned by balls

- Nimrod Megiddo

- 1989
- Discrete and Computational Geometry

## A linear-time algorithm for computing the voronoi diagram of a convex polygon

- Alok Aggarwal
- Leonidas J. Guibas
- et al.

- 1989
- Discrete and Computational Geometry

## On arrangements of Jordan arcs with three intersections per pair

- Herbert Edelsbrunner
- Leonidas Guibas
- et al.

- 1989
- Discrete and Computational Geometry

## Implicitly representing arrangements of lines or segments

- Herbert Edelsbrunner
- Leonidas Guibas
- et al.

- 1989
- Discrete and Computational Geometry

## On the complexity of polyhedral separability

- Nimrod Megiddo

- 1988
- Discrete and Computational Geometry

## Computing the link center of a simple polygon

- W. Lenhart
- R. Pollack
- et al.

- 1988
- Discrete and Computational Geometry