On the Complexity of the CSG Tree Extraction Problem

Autor:	Friedrich, Markus, Fayolle, Pierre-Alain
Rok vydání:	2021
Předmět:	Computer Science - Computational Geometry Computer Science - Data Structures and Algorithms Computer Science - Graphics
Druh dokumentu:	Working Paper
Popis:	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. Comment: Add references for the programming language based approaches and the construction of the intersection graph
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2103.06139 Zobrazit plný text záznamu View this record from Arxiv