Skip to main content
SpringerLink
Log in

Practical issues on the projection of polyhedral sets

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Projection of polyhedral sets is a fundamental operation in both geometry and symbolic computation. In most cases, however, it is not practically feasible to generate projections as the size of the output can be exponential in the size of the input. Even when the size of the output is manageable, we still face two serious problems: overwhelming redundancy and degeneracy. Here, we address these problems from a practical point of view. We discuss three algorithms based on algebraic and geometric techniques and we compare their performance in order to assess the feasibility of these approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.J. Duffin, On Fourier's analysis of linear inequality systems, Math. Progr. Study 1 (1974) 71–95.

    Google Scholar 

  2. M.E. Dyer and L.G. Proll, An algorithm for determining all extreme points of a convex polytope, Math. Progr. 12 (1977) 81–96.

    Google Scholar 

  3. H. Edelsbrunner,Algorithms in Computational Geometry (Springer, 1987).

  4. J.B.J. Fourier, reported in: Analyse des travaux de l'Académie Royale des Sciences, pendant l'année 1824, Partie mathématique,Histoire de l'Académie Royale des Sciences de l'Institut de France 7 (1827) pp. 47–55. (Partial English translation in: D.A. Kohler, Translation of a Report by Fourier on his work on Linear Inequalities, Opsearch 10 (1973) 38–42.

    Google Scholar 

  5. T. Gal, On the structure of the set bases of a degenerate point, J. Optim. Theory Appl. 45 (1985) 577–589.

    Google Scholar 

  6. I. Golan, Direct polyhedron projection algorithm, IBM Research Report, T.J. Watson Research Center, RC 16969 (1991).

  7. T. Huynh and J.-L. Lassez, Extreme point enumeration applied to projection of polyhedral sets, in preparation.

  8. T. Huynh, L. Joskowicz, C. Lassez and J.-L. Lassez, Reasoning about linear constraints using parametric queries, in:Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Sciences vol. 472 (Springer, 1990).

  9. J. Jaffar, M.J. Maher, P.J. Stuckey and R.H.C. Yap, Output in CLP(R), to appear,FGCS'92.

  10. J. Jaffar, S. Michaylov, P.J. Stuckey and R.H.C. Yap, The CLP(R) language and system, to appear,TOPLAS'92.

  11. Special issue on: Algorithms in Real Algebraic Geometry, J. Symbol. Comput. 5 (1988).

  12. D.A. Kohler, Projections of convex polyhedral sets, Operational Research Center Report, ORC 67-29, University of California, Berkeley (1967).

    Google Scholar 

  13. H.-J. Kruse,Degeneracy Graphs and the Neighborhood Problem, Lecture Notes in Economics and Mathematical Systems No. 260 (Springer, 1986).

  14. J.-L. Lassez, Querying constraints,Proc. ACM Conf. on Principles of Database Systems, Nashville (1990).

  15. J.-L. Lassez, T. Huynh and K. McAloon, Simplification and elimination of redundant arithmetic constraints,Logic Programming: Proc. North American Conf. (MIT Press, 1989).

  16. C. Lassez and J.-L. Lassez, Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm, IBM Research Report, T.J. Watson Research Center, RC 16779 (1991), also in:Symbolic and Numerical Computation — Towards Integration, eds. Kapur and Mundy (Academic Press).

  17. J.-L. Lassez and M.J. Maher, On Fourier's algorithm for linear arithmetic constraints, IBM Research Report, T.J. Watson Research Center, RC 14114 (1988), to appear in J. Autom. Reasoning.

  18. J.-L. Lassez and K. McAloon, A canonical form for generalized linear constraints, IBM Research Report, T.J. Watson Research Center, RC 15004 (1989), to appear in J. Symbol. Comput.

  19. T.H. Matheiss and D.S. Rubin, A survey and comparison of methods for finding all vertices of convex polyhedral sets, Math. Oper. Res. 5 (1980) 167–185.

    Google Scholar 

  20. G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, 1988).

  21. R.H. Taylor and V.T. Rajan, The efficient computation of uncertainty spaces for sensor-based robot planning IBM Research Report, T.J. Watson Research Center, RC 13998 (1988).

Download references

Author information

Authors and Affiliations

  1. IBM T.J. Watson Research Center, P.O. Box 704, 10598, Yorktown Heights, NY, USA

    Tien Huynh, Catherine Lassez & Jean-Louis Lassez

Authors
  1. Tien Huynh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Catherine Lassez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Louis Lassez
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huynh, T., Lassez, C. & Lassez, JL. Practical issues on the projection of polyhedral sets. Ann Math Artif Intell 6, 295–315 (1992). https://doi.org/10.1007/BF01535523

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01535523

Keywords

Search

Navigation