Search

EOS is an open-source software for a variety of computational tasks in flavor physics. Its use cases include theory predictions within and beyond the Standard Model of particle physics, Bayesian inference of theory parameters from experimental and theoretical likelihoods, and simulation of pseudo events for a number of signal processes. EOS ensures high-performance computations through a C++ back-end and ease of usability through a Python front-end. To achieve this flexibility, EOS enables the user to select from a variety of implementations of the relevant decay processes and hadronic matrix elements at run time. In this article, we describe the general structure of the software framework and provide basic examples. Further details and in-depth interactive examples are provided as part of the EOS online documentation., Comment: 32 pages, 8 figures, 4 ancillary Jupyter example notebooks

Voronoi Diagrams are defined by a system of bisecting curves in the plane, rather than by the concept of distance [K88a,b]. Mehlhorn, Meiser, Ó'Dúnlaing [MMO] showed how to construct such diagrams in time O(n log n) by a randomized algorithm if the bisecting curves are in general position. In this paper we drop the general position assumption. Moreover, we show that the only geometric operation in the algorithm is the construction of a Voronoi diagram for five sites. Using this operation, abstract Voronoi diagrams can be constructed in a purley combinatorial manner. This has the following advantages. On the one hand, the construction of a five-site-diagram is the only operation depending on the particular type of bisecting curves and we can therefore apply the algorithm to all concrete diagrams by simply replacing this operation. On the other hand, this is the only operation computing intersection points; thus, problems arising from instable numerical computations can occur only there.

We present a framework that allows to easily derive transformations for various kinds of Voronoi and Power diagrams including k-th order and weighted versions. All proofs are essentially geometric and require no analytic calculations. Some new algorithms can be presented in special cases.