The Polyhedral Library (PolyLib for short) operates on objects made up of unions of polyhedra of any dimension. It was first developed by Doran Wilde at IRISA, in Rennes, France, in connection with the ALPHA project. This first version (1.1) manipulates non parameterized unions of polyhedra through the following operations: intersection, difference, union, convex hull, simplify, image and preimage, plus some input and output functions. The polyhedra are computed in their dual implicit and Minkowski representations, in homogeneous spaces. Version 2 of the PolyLib included parameterized vertices computation. PolyLib3.14 includes Ehrhart polynomials computation, which permits to count the number of integer points contained in a parameterized polyhedron. PolyLib4 included the GNU MP library (as a compilation option), and 64 bits computations, in order to avoid integer overflows. Polylib5 is a merge of Strasbourg, Rennes and BYU Polylib.

References in zbMATH (referenced in 47 articles )

Showing results 1 to 20 of 47.
Sorted by year (citations)

1 2 3 next

  1. Dranichak, Garrett M.; Wiecek, Margaret M.: On highly robust efficient solutions to uncertain multiobjective linear programs (2019)
  2. Grégoire, Thomas; Chlipala, Adam: Mostly automated formal verification of loop dependencies with applications to distributed stencil algorithms (2019)
  3. Zolotykh, Nikolai Yu.; Bastrakov, Sergei I.: Two variations of graph test in double description method (2019)
  4. Maréchal, Alexandre; Périn, Michaël: Efficient elimination of redundancies in polyhedra by raytracing (2017)
  5. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  6. Grégoire, Thomas; Chlipala, Adam: Mostly automated formal verification of loop dependencies with applications to distributed stencil algorithms (2016)
  7. Muller, Jean-Michel: Elementary functions. Algorithms and implementation (2016)
  8. Cimatti, Alessandro; Micheli, Andrea; Roveri, Marco: Solving strong controllability of temporal problems with uncertainty using SMT (2015)
  9. Roux, Alet; Zastawniak, Tomasz: Linear vector optimization and European option pricing under proportional transaction costs (2015)
  10. Ben-Amram, Amir M.; Genaim, Samir: Ranking functions for linear-constraint loops (2014)
  11. Feller, Christian; Johansen, Tor Arne; Olaru, Sorin: An improved algorithm for combinatorial multi-parametric quadratic programming (2013)
  12. Le Chenadec, Vincent; Pitsch, Heinz: A 3D unsplit forward/backward volume-of-fluid approach and coupling to the level set method (2013)
  13. Diss, Mostapha; Louichi, Ahmed; Merlin, Vincent; Smaoui, Hatem: An example of probability computations under the IAC assumption: the stability of scoring rules (2012)
  14. Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr: A complexity perspective on entailment of parameterized linear constraints (2012)
  15. Motallebi, Hassan; Azgomi, Mohammad Abdollahi: Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets (2012)
  16. Beck, Matthias; van Herick, Andrew: Enumeration of (4 \times4) magic squares (2011)
  17. Simon, Axel; King, Andy: The two variable per inequality abstract domain (2010)
  18. Verdoolaege, Sven: isl: An integer set library for the polyhedral model (2010)
  19. Bagnara, Roberto; Hill, Patricia M.; Zaffanella, Enea: Applications of polyhedral computations to the analysis and verification of hardware and software systems (2009)
  20. Olaru, S.; Dumitrache, I.; Dumur, D.: Geometrical analysis of model predictive control: A parameterized polyhedra approach (2009)

1 2 3 next