Convex
Convex - a Maple package for convex geometry. Convex is a Maple package for computations in rational convex geometry. Here ”rational” means that all coordinates must be rational numbers. The package provides functions for ”linear” as well as ”affine” convex geometry. In the affine setting, the basic objects are polyhedra, which are intersections of finitely many (affine) halfspaces. Polyhedra can also be described as the convex hull of finitely many points and rays. A bounded polyhedron is also called a polytope. In the Convex package, polyhedra are represented by the type POLYHEDRON and polytopes by the subtype POLYTOPE. A POLYHEDRON may contain lines and may not be full-dimensional. The most important functions to define a POLYHEDRON are convhull and intersection. The linear setting is based on cones, which are intersections of finitely many linear halfspaces (i.e., whose boundary contains the origin). Cones are generated by finitely many rays. In the Convex package, cones are represented by the type CONE. They may contain lines and may not be full-dimensional. A CONE can be created from either description with the functions poshull and intersection, respectively. The Convex package can deal with polyhedral complexes (simplicial complexes, for example) and fans. See the types PCOMPLEX and FAN. It also provides functions to do calculations in the face lattice of a cone or polyhedron, see the types CFACE and PFACE. The functions traverse and traverse2 are some kind of map for faces: One can apply a given function to all faces of a cone or polyhedron, or to all pairs (f1, f2), where f1 is a facet of f2. See CONE[traverse], CONE[traverse2] and POLYHEDRON[traverse], POLYHEDRON[traverse2]. More generally, these functions can be used with fans and polyhedral complexes.
Keywords for this software
References in zbMATH (referenced in 33 articles )
Showing results 1 to 20 of 33.
Sorted by year (- Diss, Mostapha; Mahajne, Muhammad: Social acceptability of Condorcet committees (2020)
- El Ouafdi, Abdelhalim; Lepelley, Dominique; Smaoui, Hatem: Probabilities of electoral outcomes: from three-candidate to four-candidate elections (2020)
- Rossi, Michele; Terracini, Lea: Toric varieties and Gröbner bases: the complete (\mathbbQ)-factorial case (2020)
- Grabisch, Michel; Kroupa, Tomáš: The cone of supermodular games on finite distributive lattices (2019)
- Fahrner, Anne: Algorithms for embedded monoids and base point free problems (2018)
- Amaris, Armando Rodado; Lusares, Gina: The circle pattern uniformization problem (2017)
- González-Torres, Raúl E.: A geometric study of cores of idempotent stochastic matrices (2017)
- Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
- Choi, Suyoung; Park, Hanchul: Wedge operations and torus symmetries (2016)
- Rodado, Amaris Armando; Lusares, Gina: Parametrised databases of surfaces based on Teichmüller theory (2016)
- Roux, Alet: Pricing and hedging game options in currency models with proportional transaction costs (2016)
- Roux, Alet; Zastawniak, Tomasz: American and Bermudan options in currency markets with proportional transaction costs (2016)
- Studený, Milan; Kroupa, Tomáš: Core-based criterion for extreme supermodular functions (2016)
- Amaris, Armando J. R.; Cox, Murray P.: A flexible theoretical representation for the temporal dynamics of structured populations as paths on polytope complexes (2015)
- Hausen, Jürgen; Keicher, Simon: A software package for Mori dream spaces (2015)
- Roux, Alet; Zastawniak, Tomasz: Linear vector optimization and European option pricing under proportional transaction costs (2015)
- Juergen Hausen, Simon Keicher: A software package for Mori dream spaces (2014) arXiv
- Bourqui, David: Examples of counting curves on surfaces (2013)
- Bourqui, David: Moduli spaces of curves and Cox rings (2012)
- Keller, Wolfgang; Martinet, Jacques; Schürmann, Achill: On classifying Minkowskian sublattices. With an Appendix by Mathieu Dutour Sikirić. (2012)