Computing Convex Hulls of Trajectories
Preprint
Abstract
We study the convex hulls of trajectories of polynomial dynamical systems. Such trajectories include real algebraic curves. The boundaries of the resulting convex bodies are stratified into families of faces. We present numerical algorithms for identifying these patches. An implementation based on the software Bensolve Tools is given. This furnishes a key step in computing attainable regions of chemical reaction networks.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- The vector linear program solver Bensolve – notes on theoretical backgroundEuropean Journal of Operational Research, 2017
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programmingMathematical Methods of Operations Research, 2016
- On globally defined semianalytic setsMathematische Annalen, 2015
- Efficient convex hull computation for planar freeform curvesComputers & Graphics, 2011
- A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programmingJournal of Global Optimization, 2011
- Toric dynamical systemsJournal of Symbolic Computation, 2009
- Approximation of convex sets by polytopesJournal of Mathematical Sciences, 2008
- Optimal reactor design from a geometric viewpoint—I. Universal properties of the attainable regionChemical Engineering Science, 1997
- Convex hulls of objects bounded by algebraic curvesAlgorithmica, 1991
- Convex hulls of generalized moment curvesIsrael Journal of Mathematics, 1985