Markus Friedrich
ABSTRACT
The extraction of 3D models represented by Constructive Solid Geometry (CSG) trees from point clouds is a common problem in reverse engineering pipelines as used by Computer Aided Design (CAD) tools. We propose three independent enhancements on state-of-the-art Genetic Algorithms (GAs) for CSG tree extraction: (1) A deterministic point cloud filtering mechanism that significantly reduces the computational effort of objective function evaluations without loss of geometric precision, (2) a graph-based partitioning scheme that divides the problem domain in smaller parts that can be solved separately and thus in parallel and (3) a 2-level improvement procedure that combines a recursive CSG tree redundancy removal technique with a local search heuristic, which significantly improves GA running times. We show in an extensive evaluation that our optimized GA-based approach provides faster running times and scales better with problem size compared to state-of-the-art GA-based approaches.
- Matthew Berger, Andrea Tagliasacchi, Lee M Seversky, Pierre Alliez, Gael Guennebaud, Joshua A Levine, Andrei Sharf, and Claudio T Silva. 2017. A survey of surface reconstruction from point clouds. Computer Graphics Forum 36, 1 (2017), 301--329. Google Scholar
Digital Library
- Suzanne F Buchele and Richard H Crawford. 2004. Three-dimensional halfspace constructive solid geometry tree construction from implicit boundary representations. Computer-Aided Design 36, 11 (2004), 1063--1073.Google ScholarDigital Library
- Tao Du, Jeevana Priya Inala, Yewen Pu, Andrew Spielberg, Adriana Schulz, Daniela Rus, Armando Solar-Lezama, and Wojciech Matusik. 2018. InverseCSG: Automatic Conversion of 3D Models to CSG Trees. In SIGGRAPH Asia 2018 Technical Papers (SIGGRAPH Asia '18). ACM, New York, NY, USA, Article 213, 16 pages. Google ScholarDigital Library
- Agoston E Eiben, James E Smith, et al. 2003. Introduction to evolutionary computing. Vol. 53. Springer. Google ScholarDigital Library
- Pierre-Alain Fayolle and Alexander Pasko. 2016. An evolutionary approach to the extraction of object construction trees from 3D point clouds. Computer-Aided Design 74 (2016), 1--17. Google ScholarDigital Library
- Sebastian Feld, Markus Friedrich, and Claudia Linnhoff-Popien. 2018. Optimizing Geometry Compression using Quantum Annealing. In Accepted at the IEEE Workshop on Quantum Communications and Information Technology 2018 (IEEE QCIT 2018). 1--6.Google ScholarCross Ref
- Markus Friedrich, Sebastian Feld, Thomy Phan, and Pierre-Alain Fayolle. 2018. Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning. In Proceedings of WSCG International Conference on Computer Graphics, Visualization and Computer Vision.Google ScholarCross Ref
- Karim Hamza and Kazuhiro Saitou. 2004. Optimization of Constructive Solid Geometry Via a Tree-Based Multi-objective Genetic Algorithm. In Proceedings of GECCO. 981 -- 992.Google ScholarCross Ref
- Xian-Feng Han, Jesse S. Jin, Ming-Jie Wang, Wei Jiang, Lei Gao, and Liping Xiao. 2017. A review of algorithms for filtering the 3D point cloud. Signal Processing: Image Communication 57 (2017), 103 -- 112.Google ScholarCross Ref
- Natalio Krasnogor and Jim Smith. 2005. A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Transactions on Evolutionary Computation 9, 5 (2005), 474--488. Google ScholarDigital Library
- A Solar Lezama. 2008. Program synthesis by sketching. Ph.D. Dissertation. U. C. Berkeley.Google Scholar
- Lingxiao Li, Minhyuk Sung, Anastasia Dubrovina, Li Yi, and Leonidas Guibas. 2018. Supervised Fitting of Geometric Primitives to 3D Point Clouds. arXiv preprint arXiv:1811.08988 (2018).Google Scholar
- Nasimul Noman and Hitoshi Iba. 2008. Accelerating differential evolution using an adaptive local search. IEEE Transactions on evolutionary Computation 12, 1 (2008), 107--125. Google ScholarDigital Library
- A. Ricci. 1973. A constructive geometry for computer graphics. Comput. J. 16, 2 (1973), 157--160.Google ScholarCross Ref
- Ruwen Schnabel, Roland Wahl, and Reinhard Klein. 2007. Efficient RANSAC for point-cloud shape detection. Computer graphics forum 26, 2 (2007), 214--226.Google Scholar
- Vadim Shapiro. 2001. A convex deficiency tree algorithm for curved polygons. International Journal of Computational Geometry & Applications 11, 02 (2001), 215--238.Google ScholarCross Ref
- Vadim Shapiro and Donald L Vossler. 1991. Construction and optimization of CSG representations. Computer-Aided Design 23, 1 (1991), 4--20. Google ScholarDigital Library
- Vadim Shapiro and Donald L Vossler. 1991. Efficient CSG representations of two-dimensional solids. Journal of Mechanical Design 113, 3 (1991), 292--305.Google ScholarCross Ref
- Vadim Shapiro and Donald L Vossler. 1993. Separation for boundary to CSG conversion. ACM Transactions on Graphics (TOG) 12, 1 (1993), 35--55. Google ScholarDigital Library
- Gopal Sharma, Rishabh Goyal, Difan Liu, Evangelos Kalogerakis, and Subhransu Maji. 2018. CSGNet: Neural Shape Parser for Constructive Solid Geometry. (2018).Google Scholar
- Sara Silva, Pierre-Alain Fayolle, Johann Vincent, Guillaume Pauron, Christophe Rosenberger, and Christian Toinard. 2005. Evolutionary computation approaches for shape modelling and fitting. In Progress in Artificial Intelligence. Springer Berlin Heidelberg, 144--155. Google ScholarDigital Library
- Daniel Weiss. 2009. Geometry-based structural optimization on CAD specification trees. Ph.D. Dissertation. ETH Zurich.Google Scholar
- Qiaoyun Wu, Kai Xu, and Jun Wang. 2018. Constructing 3D CSG Models from 3D Raw Point Clouds. Computer Graphics Forum 37, 5 (2018), 221--232.Google ScholarCross Ref
Index Terms
- Optimizing evolutionary CSG tree extraction
Recommendations
Direct rendering of Boolean combinations of self-trimmed surfaces
We explore different semantics for the solid defined by a self-crossing surface (immersed sub-manifold). Specifically, we introduce rules for the interior/exterior classification of the connected components of the complement of a self-crossing surface ...
Evolutionary algorithms and simulated annealing in the topological configuration of the spanning tree
In this paper, the author proposes the application of a genetic algorithm and simulated annealing to solve the network planning problem. Compared with other optimisation methods, genetic algorithm and simulated annealing are suitable for traversing ...
Comparative Analysis of Evolutionary Algorithms for the Problem of Parametric Optimization of PID Controllers
Six modern and promising evolutionary algorithms are described: genetic algorithm, differential evolution method, variational genetic algorithm, particle swarm optimization algorithm, bat-inspired method and firefly algorithm. For all algorithms brief ...
Comments