On the Complexity of the CSG Tree Extraction Problem

03/09/2021

∙

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.

READ FULL TEXT

On the Complexity of the CSG Tree Extraction Problem

A Note on Generic Tangle Algorithms

A new compressed cover tree for k-nearest neighbour search and the stable-under-noise mergegram of a point cloud

The Open Problem of Finding a General Classification of Geodetic Graphs

Tigris: Architecture and Algorithms for 3D Perception in Point Clouds

Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning

UCSG-Net – Unsupervised Discovering of Constructive Solid Geometry Tree

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays

On the Complexity of the CSG Tree Extraction Problem

Related Research

A Note on Generic Tangle Algorithms

A new compressed cover tree for k-nearest neighbour search and the stable-under-noise mergegram of a point cloud

The Open Problem of Finding a General Classification of Geodetic Graphs

Tigris: Architecture and Algorithms for 3D Perception in Point Clouds

Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning

UCSG-Net – Unsupervised Discovering of Constructive Solid Geometry Tree

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays