A Flexible Pipeline for the Optimization of CSG Trees

by   Markus Friedrich, et al.

CSG trees are an intuitive, yet powerful technique for the representation of geometry using a combination of Boolean set-operations and geometric primitives. In general, there exists an infinite number of trees all describing the same 3D solid. However, some trees are optimal regarding the number of used operations, their shape or other attributes, like their suitability for intuitive, human-controlled editing. In this paper, we present a systematic comparison of newly developed and existing tree optimization methods and propose a flexible processing pipeline with a focus on tree editability. The pipeline uses a redundancy removal and decomposition stage for complexity reduction and different (meta-)heuristics for remaining tree optimization. We also introduce a new quantitative measure for CSG tree editability and show how it can be used as a constraint in the optimization process.


page 1

page 2

page 3

page 4


UCSG-Net – Unsupervised Discovering of Constructive Solid Geometry Tree

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

Geometric comparison of phylogenetic trees with different leaf sets

The metric space of phylogenetic trees defined by Billera, Holmes, and V...

Zipping Segment Trees

Stabbing queries in sets of intervals are usually answered using segment...

Quantification of Carbon Sequestration in Urban Forests

Vegetation, trees in particular, sequester carbon by absorbing carbon di...

Generation of Tree-Child phylogenetic networks

Phylogenetic networks generalize phylogenetic trees by allowing the mode...

Geometric tree kernels: Classification of COPD from airway tree geometry

Methodological contributions: This paper introduces a family of kernels ...

Please sign up or login with your details

Forgot password? Click here to reset