Log In Sign Up

Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning

by   Markus Friedrich, et al.

Extracting a Construction Tree from potentially noisy point clouds is an important aspect of Reverse Engineering tasks in Computer Aided Design. Solutions based on algorithmic geometry impose constraints on usable model representations (e.g. quadric surfaces only) and noise robustness. Re-formulating the problem as a combinatorial optimization problem and solving it with an Evolutionary Algorithm can mitigate some of these constraints at the cost of increased computational complexity. This paper proposes a graph-based search space partitioning scheme that is able to accelerate Evolutionary Construction Tree extraction while exploiting parallelization capabilities of modern CPUs. The evaluation indicates a speed-up up to a factor of 46.6 compared to the baseline approach while resulting tree sizes increased by 25.2% to 88.6%.


page 7

page 9


Recent Progress on Graph Partitioning Problems Using Evolutionary Computation

The graph partitioning problem (GPP) is a representative combinatorial o...

Fitting 3D Shapes from Partial and Noisy Point Clouds with Evolutionary Computing

Point clouds obtained from photogrammetry are noisy and incomplete model...

Distributed Evolutionary Graph Partitioning

We present a novel distributed evolutionary algorithm, KaFFPaE, to solve...

On the Complexity of the CSG Tree Extraction Problem

In this short note, we discuss the complexity of the search space for th...

Reconstruction of Convex Polytope Compositions from 3D Point-clouds

Reconstructing a composition (union) of convex polytopes that perfectly ...

Erdös-Szekeres Partitioning Problem

In this note, we present a substantial improvement on the computational ...

Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem

Overlaid oriented Voronoi diagrams (OOVDs) are known to provide useful d...