default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Altenhofen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j6]Christian Altenhofen
, Tobias Ewald, André Stork, Dieter W. Fellner:
Analyzing and Improving the Parameterization Quality of Catmull-Clark Solids for Isogeometric Analysis. IEEE Computer Graphics and Applications 41(3): 34-47 (2021)- [j5]Michel Krämer, Hendrik M. Würz, Christian Altenhofen:
Executing cyclic scientific workflows in the cloud. J. Cloud Comput. 10(1): 25 (2021) - [c7]Sebastian Besler, Christian Altenhofen, André Stork, Dieter W. Fellner:
GPU-Parallel Constant-Time Limit Evaluation of Catmull-Clark Solids. VMV 2021: 35-46
2010 – 2019
- 2019
- [j4]Thu Huong Luu, Christian Altenhofen, Tobias Ewald, André Stork, Dieter W. Fellner:
Efficient slicing of Catmull-Clark solids for 3D printed objects with functionally graded material. Comput. Graph. 82: 295-303 (2019) - [i1]Christian Altenhofen, Marco Attene, Oliver J. D. Barrowclough, Michele Chiumenti, Marco Livesu, Federico Marini, Massimiliano Martinelli, Vibeke Skytt, Lorenzo Tamellini:
Parametric shape optimization for combined additive-subtractive manufacturing. CoRR abs/1907.01370 (2019) - 2018
- [c6]Christian Altenhofen, Joel Müller, Daniel Weber, André Stork, Dieter W. Fellner:
Direct Limit Volumes: Constant-Time Limit Evaluation for Catmull-Clark Solids. PG (Short Papers and Posters) 2018: 77-80 - [c5]Christian Ritter, Christian Altenhofen, Matthias Zeppelzauer, Arjan Kuijper, Tobias Schreck, Jürgen Bernard:
Personalized Visual-Interactive Music Classification. EuroVA@EuroVis 2018: 31-35 - 2017
- [j3]Christian Altenhofen, Felix Schuwirth, André Stork, Dieter W. Fellner:
Volumetric subdivision for consistent implicit mesh generation. Comput. Graph. 69: 68-79 (2017) - [j2]Johannes Mueller-Roemer, Christian Altenhofen, André Stork:
Ternary Sparse Matrix Representation for Volumetric Mesh Subdivision and Processing on GPUs. Comput. Graph. Forum 36(5): 59-69 (2017) - [c4]Christian Altenhofen, Felix Schuwirth, André Stork, Dieter W. Fellner:
Implicit Mesh Generation using Volumetric Subdivision. VRIPHYS 2017: 9-19 - 2015
- [j1]Daniel Weber, Johannes Mueller-Roemer, Christian Altenhofen, André Stork, Dieter W. Fellner:
Deformation simulation using cubic finite elements and efficient p-multigrid methods. Comput. Graph. 53: 185-195 (2015) - [c3]Christian Stahl, Efstratios Bellos, Christian Altenhofen, Jon M. Hjelmervik:
Flexible integration of cloud-based engineering services using semantic technologies. ICIT 2015: 1520-1525 - 2014
- [c2]Martin Knuth, Christian Altenhofen, Arjan Kuijper, Jan Bender:
Efficient Self-Shadowing Using Image-Based Lighting on Glossy Surfaces. VMV 2014: 159-166 - [c1]Daniel Weber, Johannes Mueller-Roemer, Christian Altenhofen, André Stork, Dieter W. Fellner:
A p-Multigrid Algorithm using Cubic Finite Elements for Efficient Deformation Simulation. VRIPHYS 2014: 49-58
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
