On the Complexity of the CSG Tree Extraction Problem

Abstract

In this short note, we discuss the complexity of the search space for the problem of finding a CSG expression (or CSG tree) corresponding to an input point-cloud and a list of fitted solid primitives.

arXiv commentAdd references for the programming language based approaches and the construction of the intersection graph

References in corpus (2)

• Learning to Infer and Execute 3D Shape Programs
• UCSG-Net -- Unsupervised Discovering of Constructive Solid Geometry Tree