Plane arrangements are a useful tool for surface and volume modelling. However, their main drawback is poor scalability. We introduce two key novelties that enable the construction of plane arrangements for complex objects and entire scenes: an ordering scheme for the plane insertion and the direct use of input points during arrangement construction. Both ingredients reduce the number of unwanted splits, resulting in improved scalability of the construction mechanism by up to two orders of magnitude compared to existing algorithms. We further introduce a remeshing and simplification technique that allows us to extract low-polygon surface meshes and lightweight convex decompositions of volumes from the arrangement. We show that our approach leads to state-of-the-art results for the aforementioned tasks by comparing it to learning-based and traditional approaches on various different datasets. Our implementation is available at https://github.com/raphaelsulzer/compod .

翻译：平面排列是曲面与体积建模中的有效工具，但其主要缺陷在于可扩展性较差。我们提出了两项关键创新，以实现针对复杂对象和完整场景的平面排列构建：一种平面插入顺序方案，以及在排列构建过程中直接使用输入点。这两个要素减少了不必要的分割数量，使得构建机制的可扩展性相比现有算法提升达两个数量级。我们进一步引入了一种重新网格化与简化技术，能够从排列中提取低多边形曲面网格和轻量级凸体积分解。通过在不同数据集上与基于学习和传统方法进行对比，我们证明了所提方法在上述任务中达到了最先进水平。我们的实现代码位于 https://github.com/raphaelsulzer/compod。