![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Rasmus Tamstorf
Person information
- affiliation (former): Walt Disney Animation Studios, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c10]Paul Zhang
, Zoë Marschner
, Justin Solomon
, Rasmus Tamstorf
:
Sum-of-Squares Collision Detection for Curved Shapes and Paths. SIGGRAPH (Conference Paper Track) 2023: 76:1-76:11 - [i6]Nils Kohl, Stephen F. McCormick, Rasmus Tamstorf:
Multigrid Methods using Block Floating Point Arithmetic. CoRR abs/2307.00124 (2023) - [i5]Stephen F. McCormick, Rasmus Tamstorf:
Rounding-Error Analysis of Multigrid V-Cycles. CoRR abs/2307.00216 (2023) - 2022
- [i4]Joseph Benzaken, John A. Evans, Rasmus Tamstorf:
Constructing Nitsche's method for variational problems. CoRR abs/2203.02603 (2022) - 2021
- [j20]Stephen F. McCormick, Joseph Benzaken, Rasmus Tamstorf
:
Algebraic Error Analysis for Mixed-Precision Multigrid Solvers. SIAM J. Sci. Comput. 43(5): S392-S419 (2021) - [j19]Rasmus Tamstorf
, Joseph Benzaken, Stephen F. McCormick:
Discretization-Error-Accurate Mixed-Precision Multigrid Solvers. SIAM J. Sci. Comput. 43(5): S420-S447 (2021) - 2020
- [i3]Joseph Benzaken, John A. Evans, Stephen F. McCormick, Rasmus Tamstorf:
Weak Boundary Condition Enforcement for Linear Kirchhoff-Love Shells: Formulation, Error Analysis, and Verification. CoRR abs/2007.01279 (2020) - [i2]Stephen F. McCormick, Joseph Benzaken, Rasmus Tamstorf:
Algebraic error analysis for mixed-precision multigrid solvers. CoRR abs/2007.06614 (2020) - [i1]Rasmus Tamstorf, Joseph Benzaken, Stephen F. McCormick:
Discretization-error-accurate mixed-precision multigrid solvers. CoRR abs/2007.06628 (2020)
2010 – 2019
- 2019
- [j18]Alena Kopanicáková
, Rolf Krause
, Rasmus Tamstorf
:
Subdivision-Based Nonlinear Multiscale Cloth Simulation. SIAM J. Sci. Comput. 41(5): S433-S461 (2019) - [c9]Rasmus Tamstorf
, Heather Pritchett:
The Challenges of Releasing the Moana Island Scene. EGSR (DL/I) 2019: 73-75 - 2018
- [j17]Qi Guo, Xuchen Han, Chuyuan Fu, Theodore F. Gast, Rasmus Tamstorf
, Joseph Teran:
A material point method for thin shells with frictional contact. ACM Trans. Graph. 37(4): 147 (2018) - 2017
- [j16]Etienne Vouga, Breannan Smith, Danny M. Kaufman, Rasmus Tamstorf
, Eitan Grinspun:
All's well that ends well: guaranteed resolution of simultaneous rigid body impact. ACM Trans. Graph. 36(4): 151:1-151:19 (2017) - [c8]David Clyde, Joseph Teran, Rasmus Tamstorf
:
Modeling and data-driven parameter estimation for woven fabrics. Symposium on Computer Animation 2017: 17:1-17:11 - 2016
- [b1]Rasmus Tamstorf:
Large scale simulation of cloth and hair with contact. ETH Zurich, Zürich, Switzerland, 2016 - [c7]Andy Milne, Mark McLaughlin, Rasmus Tamstorf
, Alexey Stomakhin
, Nicholas Burkard, Mitch Counsell, Jesus Canal, David Komorowski, Evan Goldberg:
Flesh, flab, and fascia simulation on zootopia. SIGGRAPH Talks 2016: 34:1-34:2 - 2015
- [j15]Rasmus Tamstorf
, Toby Jones, Stephen F. McCormick:
Smoothed aggregation multigrid for cloth simulation. ACM Trans. Graph. 34(6): 245:1-245:13 (2015) - [c6]Carlos Aliaga
, Carol O'Sullivan
, Diego Gutierrez, Rasmus Tamstorf
:
Sackcloth or silk?: the impact of appearance vs dynamics on the perception of animated cloth. SAP 2015: 41-46 - [c5]Xiang Ni, Laxmikant V. Kalé, Rasmus Tamstorf
:
Scalable Asynchronous Contact Mechanics Using Charm++. IPDPS 2015: 677-686 - 2014
- [j14]Danny M. Kaufman, Rasmus Tamstorf
, Breannan Smith, Jean-Marie Aubry, Eitan Grinspun:
Adaptive nonlinearity for collisions in complex rod assemblies. ACM Trans. Graph. 33(4): 123:1-123:12 (2014) - 2013
- [j13]Rasmus Tamstorf
, Eitan Grinspun:
Discrete bending forces and their Jacobians. Graph. Model. 75(6): 362-370 (2013) - [j12]Eder Miguel
, Rasmus Tamstorf
, Derek Bradley, Sara C. Schvartzman, Bernhard Thomaszewski
, Bernd Bickel
, Wojciech Matusik, Steve Marschner, Miguel A. Otaduy
:
Modeling and estimation of internal friction in cloth. ACM Trans. Graph. 32(6): 212:1-212:10 (2013) - 2012
- [j11]David Harmon, Etienne Vouga, Breannan Smith, Rasmus Tamstorf
, Eitan Grinspun:
Asynchronous contact mechanics. Commun. ACM 55(4): 102-109 (2012) - [j10]Breannan Smith, Danny M. Kaufman, Etienne Vouga, Rasmus Tamstorf
, Eitan Grinspun:
Reflections on simultaneous impact. ACM Trans. Graph. 31(4): 106:1-106:12 (2012) - [j9]Samantha Ainsley, Etienne Vouga, Eitan Grinspun, Rasmus Tamstorf
:
Speculative parallel asynchronous contact mechanics. ACM Trans. Graph. 31(6): 151:1-151:8 (2012) - 2011
- [j8]Aleka McAdams, Yongning Zhu, Andrew Selle, Mark Empey, Rasmus Tamstorf
, Joseph Teran, Eftychios Sifakis:
Efficient elasticity for character skinning with contact and collisions. ACM Trans. Graph. 30(4): 37 (2011) - [c4]Jeroen van Baar, Steven Poulakos, Wojciech Jarosz, Derek Nowrouzezahrai, Rasmus Tamstorf
, Markus H. Gross
:
Perceptually-based compensation of light pollution in display systems. APGV 2011: 45-52 - 2010
- [j7]Iman Sadeghi, Heather Pritchett, Henrik Wann Jensen, Rasmus Tamstorf
:
An artist friendly hair shading system. ACM Trans. Graph. 29(4): 56:1-56:10 (2010)
2000 – 2009
- 2009
- [j6]Miguel A. Otaduy
, Rasmus Tamstorf
, Denis Steinemann, Markus H. Gross
:
Implicit Contact Handling for Deformable Objects. Comput. Graph. Forum 28(2): 559-568 (2009) - [j5]David Harmon, Etienne Vouga, Breannan Smith, Rasmus Tamstorf
, Eitan Grinspun:
Asynchronous contact mechanics. ACM Trans. Graph. 28(3): 87 (2009) - [j4]David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf:
Approximate topological matching of quad meshes. Vis. Comput. 25(8): 771-783 (2009) - 2008
- [j3]David Eppstein, Michael T. Goodrich
, Ethan Kim, Rasmus Tamstorf
:
Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum 27(5): 1477-1486 (2008) - [j2]David Harmon, Etienne Vouga, Rasmus Tamstorf
, Eitan Grinspun:
Robust treatment of simultaneous collisions. ACM Trans. Graph. 27(3): 23 (2008) - [c3]Sean Curtis, Rasmus Tamstorf
, Dinesh Manocha
:
Fast collision detection for deformable models using representative-triangles. SI3D 2008: 61-69 - [c2]David Eppstein, Michael T. Goodrich
, Ethan Kim, Rasmus Tamstorf
:
Approximate topological matching of quadrilateral meshes. Shape Modeling International 2008: 83-92 - 2005
- [j1]Naga K. Govindaraju, David Knott, Nitin Jain, Ilknur Kabul, Rasmus Tamstorf
, Russell Gayle, Ming C. Lin, Dinesh Manocha
:
Interactive collision detection between deformable models using chromatic decomposition. ACM Trans. Graph. 24(3): 991-999 (2005)
1990 – 1999
- 1997
- [c1]Rasmus Tamstorf
, Henrik Wann Jensen:
Adaptive Smpling and Bias Estimation in Path Tracing. Rendering Techniques 1997: 285-296
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint