GEOMETRIC MODELLING AND ALGORITHMS FOR BINARY MIXTURES

doi:10.1142/s021819599400015x

GEOMETRIC MODELLING AND ALGORITHMS FOR BINARY MIXTURES

2011-11-20

0

PRE

AI

DOI：10.1142/s021819599400015x

原文链接

原文求助

摘要

En 中文

We present some computational methods in a particular case of mixing and separation theory, as an application of classical results in the field of computational geometry. Our aim is the production of some given mixtures by mixing parts of basic products. In the geometrical approach we use, products or mixtures are characterized by vectors and the mixing process by vector sums, in the vector space of physico-chemical species. The feasibility of a mixture is viewed as a point-inclusion in the convex set of mixtures which is a zonotope associated with basic mixtures. This paper is concerned with binary mixtures characterized by two species. The geometrical approach leads to plane geometry problems and gives complete solutions to the optimal fabrication of a mixture, as well as to the fabrication of a sequence of several mixtures. Using the framework of computational geometry, we present efficient algorithms for solving the main problems related to the management of binary mixtures.

GEOMETRIC MODELLING AND ALGORITHMS FOR BINARY MIXTURES

摘要

AI总结

期刊

机构

引用论文