Luu, Thu Huong ; Altenhofen, Christian ; Ewald, Tobias ; Stork, André ; Fellner, Dieter (2019)
Efficient slicing of Catmull–Clark solids for 3D printed objects with functionally graded material.
In: Computers & Graphics, 82
doi: 10.1016/j.cag.2019.05.023
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
In the competition for the volumetric representation most suitable for functionally graded materials in additively manufactured (AM) objects, volumetric subdivision schemes, such as Catmull-Clark (CC) solids, are widely neglected. Although they show appealing properties, e_cient implementations of some fundamental algorithms are still missing. In this paper, we present a fast algorithm for direct slicing of CC-solids generating bitmaps printable by multi-material AMmachines. Our method optimizes runtime by exploiting constant time limit evaluation and other structural characteristics of CCsolids. We compare our algorithm with the state of the art in trivariate trimmed spline representations and show that our algorithm has similar runtime behavior as slicing trivariate splines, fully supporting the benefits of CC-solids.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2019 |
| Autor(en): | Luu, Thu Huong ; Altenhofen, Christian ; Ewald, Tobias ; Stork, André ; Fellner, Dieter |
| Art des Eintrags: | Bibliographie |
| Titel: | Efficient slicing of Catmull–Clark solids for 3D printed objects with functionally graded material |
| Sprache: | Englisch |
| Publikationsjahr: | August 2019 |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Computers & Graphics |
| Jahrgang/Volume einer Zeitschrift: | 82 |
| DOI: | 10.1016/j.cag.2019.05.023 |
| URL / URN: | https://doi.org/10.1016/j.cag.2019.05.023 |
| Kurzbeschreibung (Abstract): | In the competition for the volumetric representation most suitable for functionally graded materials in additively manufactured (AM) objects, volumetric subdivision schemes, such as Catmull-Clark (CC) solids, are widely neglected. Although they show appealing properties, e_cient implementations of some fundamental algorithms are still missing. In this paper, we present a fast algorithm for direct slicing of CC-solids generating bitmaps printable by multi-material AMmachines. Our method optimizes runtime by exploiting constant time limit evaluation and other structural characteristics of CCsolids. We compare our algorithm with the state of the art in trivariate trimmed spline representations and show that our algorithm has similar runtime behavior as slicing trivariate splines, fully supporting the benefits of CC-solids. |
| Freie Schlagworte: | 3D Printing Subdivision Material definitions Computational geometry |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Graphisch-Interaktive Systeme |
| Hinterlegungsdatum: | 09 Apr 2020 13:44 |
| Letzte Änderung: | 04 Feb 2022 12:38 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum