We present a simple and practical algorithm for enumerating the set of cells C of an arrangement of m hyperplanes. For fixed dimension its time complexity is O(m. |C|). This is an improvement by a factor of m over the reverse search algorithm by Avis and Fukuda. The algorithm needs little space, is output-sensitive, straightforward to parallelize and the implementation is simple for all dimensions.
展开▼
机译：我们提出一种简单实用的算法，用于枚举m个超平面排列的单元格C的集合。对于固定维，其时间复杂度为O（m。| C |）。这比Avis和Fukuda的反向搜索算法提高了m倍。该算法需要的空间很小，对输出敏感，易于并行化，并且在所有维度上的实现都很简单。
展开▼
