## Helly-type theorems and generalized linear programming (1994)

### Cached

### Download Links

- [www.cs.ucdavis.edu]
- [www.cs.ucdavis.edu]
- [www.geom.umn.edu]
- DBLP

### Other Repositories/Bibliography

by
Annamaria Beatrice Amenta

Venue: | DISCRETE COMPUT. GEOM |

Citations: | 59 - 0 self |

### BibTeX

@ARTICLE{Amenta94helly-typetheorems,

author = {Annamaria Beatrice Amenta},

title = {Helly-type theorems and generalized linear programming},

journal = {DISCRETE COMPUT. GEOM},

year = {1994},

volume = {12},

pages = {241--261}

}

### Years of Citing Articles

### OpenURL

### Abstract

This thesis establishes a connection between the Helly theorems, a collection of results from combinatorial geometry, and the class of problems which we call Generalized Linear Programming, or GLP, which can be solved by combinatorial linear programming algorithms like the simplex method. We use these results to explore the class GLP and show new applications to geometric optimization, and also to prove Helly theorems. In general, a GLP is a set...