We present a new and elegant cycle vector space algorithm that runs in O(n 2) steps and needs O(n) space for enumerating all the cycles of a planar graph with n vertices, where is the total number of simple cycles in the graph. Unlike backtrack algorithms, cycle vector space algorithms for this problem are suitable for parallelization. A parallel version of this algorithm along with a parallel ...

In a previous report we used the Linked Dipole Chain model unintegrated gluon densities to investigate the uncertainties in the predictions for central exclusive production of scalars at hadron colliders. Here we expand this investigation by also looking at other parameterizations of the unintegrated gluon density, and look in more detail on the behavior of these at small k⊥. We confirm our con...

In this paper it is discussed a new method to transform a closed and possibly unconnected polyline into a plane polygon represented as a BSP tree In particular it is shown that each such polygon can be expressed as the Boolean XOR of unbounded quadrilateral stripes bijectively associated to the polyline edges Such a representation has a space complexity of O n where n is the number of polygon e...