Degenerate Convex Hulls in High Dimensions Without Extra Storage (1992)
Cached
Download Links
- [www.inf.fu-berlin.de]
- [www.inf.fu-berlin.de]
- DBLP
Other Repositories/Bibliography
by
Günter Rote
| Citations: | 11 - 1 self |
BibTeX
@MISC{Rote92degenerateconvex,
author = {Günter Rote},
title = {Degenerate Convex Hulls in High Dimensions Without Extra Storage},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 229 | Distance–Regular Graphs - Brouwer, Cohen, et al. - 1989 |
| 177 | Small-dimensional linear programming and convex hulls made easy - Seidel - 1991 |
| 83 | A combinatorial bound for linear programming and related problems - Sharir, Welzl - 1992 |
| 50 | An algorithm for convex polytopes - Chand, Kapur - 1970 |
| 12 | A complete description of the Traveling Salesman Polytope on 8 nodes - Christof, Jünger, et al. - 1991 |
| 3 | A Survey and Comparison of Methods for Finding all - Matheiss, Rubin - 1980 |
| 1 | and Komei Fukuda �1991� A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra - Avis |
| 1 | 98�104; revised version to appear - Geometry - 1991 |
| 1 | Brigitte Jaumard [1991] On-line and off-line vertex enumeration by adjacency lists - Chen, Hansen |
| 1 | Pulleyblank [1989] Polyhedral combinatorics, in: Optimization - William |
| 1 | Theoretical Aspects of Computer Science, Febr. 13�15 - Symp - 1992 |
| 1 | Brigitte Jaumard �1991� On-line and o�-line vertex enumeration by adjacency lists - Chen, Hansen |
