Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorFriedrich, Markus
dc.contributor.authorRoch, Christoph
dc.contributor.authorFeld, Sebastian
dc.contributor.authorHahn, Carsten
dc.contributor.authorFayolle, Pierre-Alain
dc.contributor.editorSkala, Václav
dc.date.accessioned2020-07-27T11:05:32Z
dc.date.available2020-07-27T11:05:32Z
dc.date.issued2020
dc.identifier.citationWSCG 2020: full papers proceedings: 28th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, p. 79-88.en
dc.identifier.isbn978-80-86943-35-0
dc.identifier.issn2464–4617 (print)
dc.identifier.issn2464–4625 (CD-ROM)
dc.identifier.urihttp://wscg.zcu.cz/WSCG2020/2020-CSRN-3001.pdf
dc.identifier.urihttp://hdl.handle.net/11025/38454
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesWSCG 2020: full papers proceedingsen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectevoluční algoritmycs
dc.subjectkvantové žíhánícs
dc.subjectzpracování geometriecs
dc.subjectCADcs
dc.subjectCSGcs
dc.subjectkombinatorická optimalizacecs
dc.titleA Flexible Pipeline for the Optimization of CSG Treesen
dc.typeconferenceObjecten
dc.typekonferenční příspěvekcs
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedCSG 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.en
dc.subject.translatedevolutionary algorithmsen
dc.subject.translatedquantum annealingen
dc.subject.translatedgeometry processingen
dc.subject.translatedCADen
dc.subject.translatedCSGen
dc.subject.translatedcombinatorial optimizationen
dc.identifier.doihttps://doi.org/10.24132/CSRN.2020.3001.10
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:WSCG 2020: Full Papers Proceedings

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
F71.pdfPlný text8,75 MBAdobe PDFZobrazit/otevřít
Zobrazit minimální záznam Zobrazit statistiky


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/38454

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.

hledání
navigace
  1. DSpace at University of West Bohemia
  2. Publikace ZČU / UWB Publications
  3. Sborníky ZČU / UWB Proceedings
  4. WSCG: Full Papers
  5. WSCG 2020: Full Papers Proceedings