Helly-type theorems and Generalized Linear Programming
- N. Amenta
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Recent combinatorial algorithms for linear programming can also be applied to certain nonlinear problems. We call these Generalized Linear-Programming, or GLP, problems. We connect this class to a collection of results from combinatorial geometry called Helly-type theorems. We show that there is a Helly-type theorem about the constraint set of every GLP problem. Given a familyH of sets with a Helly-type theorem, we give a paradigm for finding whether the intersection ofH is empty, by formulating the question as a GLP problem. This leads to many applications, including linear expected time algorithms for finding line transversals and mini-max hyperplane fitting. Our applications include GLP problems with the surprising property that the constraints are nonconvex or even disconnected.
- N. Amenta. Finding a line transversal of axial objects in three dimensionsProceeding of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pages 66–71.
- B. Aronov, J. E. Goodman, R. Pollack, and R. Wenger. There is no Hadwiger number for line transversals in higher dimensions. Unpublished manuscript, cited in [GPW], Theorem 2.9.
- Avis, D., Doskas, M. (1990) Algorithms for high dimensional stabbing problems. Discrete Applied Mathematics 27: pp. 39-48 CrossRef
- D. Avis and M. E. Houle. Computational aspects of Helly’s theorem and its relatives,Proceedings of the Third Canadian Conference on Computational Geometry, 1991, pages 11–14.
- B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension,Proceeding of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, pages 281–290.
- K. L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small, Manuscript, 1990. An earlier version appeared inProceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988, pages 452–455.
- Danzer, L., Grünbaum, B., Klee, V. (1963) Helly’s theorem and its relatives. American Mathematical Society, Providence, RI
- Demmel, J. (1992) The componentwise distance to the nearest singular matrix. SIAM Journal of Matrix Analysis and Applications 13: pp. 10-19 CrossRef
- Dyer, M. (1986) On a multidimensional search technique and its application to the Euclidean one-center problem. SIAM Journal on Computing 15: pp. 725-738 CrossRef
- M. Dyer. A class of convex programs with applications to computational geometry,Proceedings of the 8th Annual Symposium on Computational Geometry, 1992, pages 9–15.
- Eckhoff, J. Helly, Radon- and Carathody type theorems. In: Gruber, P. M., Willis, J. M. eds. (1993) Handbook of Convex Geometry. Elsevier Science, Amsterdam
- P. Egyed and R. Wenger. Stabbing pairwise disjoint translates in linear time,Proceedings of the 5th Annual Symposium on Computational Geometry, 1989, pages 364–369.
- J.E. Goodman, R. Pollack, and R. Wenger, Geometric transversal theory, inNew Trends in Discrete and Computational Geometry. Springer-Verlag, New York (to appear).
- Grünbaum, B., Motzkin, T. S. (1961) On components in some families of sets. Proceedings of the American Mathematical Society 12: pp. 607-613 CrossRef
- Hoffman, A. J. (1979) Binding constraints and Helly numbers. Annals of the New York Academy of Sciences 319: pp. 284-288 CrossRef
- G. Kalai. A subexponential randomized simplex algorithm,24th Annual ACM Symposium on the Theory of Computation, 1992, pages 475–482.
- J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming,Proceedings of the 8th Annual Symposium on Computational Geometry, 1992, pages 1–8.
- Megiddo, N. (1983) Linear programming in linear time when the dimension is fixed. SIAM Journal on Computing 12: pp. 759-776 CrossRef
- Megiddo, N. (1989) On the ball spanned by balls. Discrete and Computational Geometry 4: pp. 605-610 CrossRef
- N. Megiddo. Personal communication (1991).
- S. Poljak and J. Rohn. Radius of nonsingularity,Mathematics of Systems, Signals and Control (to appear).
- Rohn, J. (1989) Linear interval equations. Linear Algebra and Its Applications 126: pp. 39-78 CrossRef
- R. Seidel. Linear programming and convex hulls made easy,Proceedings of the 6th Annual Symposium on Computational Geometry, 1990, pages 211–215.
- Sharir, M., Welzl, E. (1992) A combinatorial bound for linear programming and related problems. Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science. Springer-Verlag, Berlin, pp. 569-579
- S. Toledo. Extremal polygon containment problems,Proceedings of the 7th Annual Symposium on Computational Geometry, 1991, pages 176–185.
- Tverberg, H. (1989) Proof of Grünbaum’s conjecture on common transversals for translates. Discrete and Computational Geometry 4: pp. 191-203 CrossRef
- Helly-type theorems and Generalized Linear Programming
Discrete & Computational Geometry
Volume 12, Issue 1 , pp 241-261
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors
- N. Amenta (1) (2)
- Author Affiliations
- 1. Computer Science, University of California, 94720, Berkeley, CA, USA
- 2. The Geometry Center, 55454, Minneapolis, MN, USA