Title: A Flexible Pipeline for the Optimization of CSG Trees
Authors: Friedrich, Markus
Roch, Christoph
Feld, Sebastian
Hahn, Carsten
Fayolle, Pierre-Alain
Citation: WSCG 2020: full papers proceedings: 28th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, p. 79-88.
Issue Date: 2020
Publisher: Václav Skala - UNION Agency
Document type: conferenceObject
konferenční příspěvek
URI: http://wscg.zcu.cz/WSCG2020/2020-CSRN-3001.pdf
http://hdl.handle.net/11025/38454
ISBN: 978-80-86943-35-0
ISSN: 2464–4617 (print)
2464–4625 (CD-ROM)
Keywords: evoluční algoritmy;kvantové žíhání;zpracování geometrie;CAD;CSG;kombinatorická optimalizace
Keywords in different language: evolutionary algorithms;quantum annealing;geometry processing;CAD;CSG;combinatorial optimization
Abstract in different language: 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.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG 2020: Full Papers Proceedings

Files in This Item:
File Description SizeFormat 
F71.pdfPlný text8,75 MBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/38454

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.