TU Darmstadt / ULB / TUbiblio

Efficient slicing of Catmull–Clark solids for 3D printed objects with functionally graded material

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, pp. 295-303. ISSN 00978493,
DOI: 10.1016/j.cag.2019.05.023,
[Article]

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.

Item Type: Article
Erschienen: 2019
Creators: Luu, Thu Huong ; Altenhofen, Christian ; Ewald, Tobias ; Stork, André ; Fellner, Dieter
Title: Efficient slicing of Catmull–Clark solids for 3D printed objects with functionally graded material
Language: English
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.

Journal or Publication Title: Computers & Graphics
Journal volume: 82
Uncontrolled Keywords: 3D Printing Subdivision Material definitions Computational geometry
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Interactive Graphics Systems
Date Deposited: 09 Apr 2020 13:44
DOI: 10.1016/j.cag.2019.05.023
Official URL: https://doi.org/10.1016/j.cag.2019.05.023
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details