DeepAI
Log In Sign Up

On the Complexity of the CSG Tree Extraction Problem

03/09/2021
by   Markus Friedrich, et al.
0

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

page 1

page 2

page 3

page 4

05/29/2020

A Note on Generic Tangle Algorithms

In this note we gather the theoretical outlines of three basic algorithm...
05/20/2022

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

This thesis consists of two topics related to computational geometry and...
02/22/2022

The Open Problem of Finding a General Classification of Geodetic Graphs

This note describes some open problems that can be examined with the pur...
10/18/2021

Fast tree skeleton extraction using voxel thinning based on tree point cloud

Tree skeleton plays an important role in tree structure analysis, forest...
08/09/2020

Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning

Extracting a Construction Tree from potentially noisy point clouds is an...
10/25/2019

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

The goal of this paper is to introduce a new method in computer-aided ge...
06/16/2020

UCSG-Net – Unsupervised Discovering of Constructive Solid Geometry Tree

Signed distance field (SDF) is a prominent implicit representation of 3D...