A geometric method of sector decomposition
A geometric method of sector decomposition
复制标题
DOI：
10.1016/j.cpc.2010.04.001
复制
发表时间：
2009-08
期刊：
影响因子：
--
通讯作者：
T. Kaneko;Takahiro Ueda
中科院分区：
文献类型：
--
作者：
T. Kaneko;Takahiro Ueda
提出了一种新的扇区分解中IR分解的几何方法。该问题转化为一组凸几何问题。后面的问题可以使用组合几何中的算法来解决。该方法提供了确定性算法，并且永远不会福尔斯无限循环。结果扇区的数量取决于三角测量的算法。我们的测试实现与其他现有的迭代方法相比，显示了更少的扇区数。
We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method provides a deterministic algorithm and never falls into an infinite loop. The number of resulting sectors depends on the algorithm of triangulation. Our test implementation shows smaller number of sectors comparing with other existing methods with iterations.