Dan Koschier

dblp:148/6551 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0002-2376-9475ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 11 · 3 first-author · 1 since 2021Artificial intelligence and machine learning · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
5 papers
Computer animation and physical simulation · 81% Geometric modeling and processing · 19%

Topics — the 13 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
fluid simulation
1.132020
Implicit Frictional Boundary Handling for SPH · IEEE Trans. Vis. Comput. Graph. 2020
Turbulent Micropolar SPH Fluids with Foam · IEEE Trans. Vis. Comput. Graph. 2019
Divergence-Free SPH for Incompressible and Viscous Fluids · IEEE Trans. Vis. Comput. Graph. 2017
Computer animation and physical simulation › fluid simulation › particle-based fluid simulation
smoothed particle hydrodynamics
1.132020
Implicit Frictional Boundary Handling for SPH · IEEE Trans. Vis. Comput. Graph. 2020
Turbulent Micropolar SPH Fluids with Foam · IEEE Trans. Vis. Comput. Graph. 2019
Divergence-Free SPH for Incompressible and Viscous Fluids · IEEE Trans. Vis. Comput. Graph. 2017
Computer animation and physical simulation › fluid simulation
turbulent flow simulation
0.412019
Turbulent Micropolar SPH Fluids with Foam · IEEE Trans. Vis. Comput. Graph. 2019
Computer animation and physical simulation
cutting simulation
0.312017
Robust eXtended finite elements for complex cutting of deformables · ACM Trans. Graph. 2017
Computer animation and physical simulation
deformable body simulation
0.312017
Robust eXtended finite elements for complex cutting of deformables · ACM Trans. Graph. 2017
Computer animation and physical simulation › fluid simulation
incompressible fluid simulation
0.312017
Divergence-Free SPH for Incompressible and Viscous Fluids · IEEE Trans. Vis. Comput. Graph. 2017
Geometric modeling and processing
mesh processing
0.312017
Robust eXtended finite elements for complex cutting of deformables · ACM Trans. Graph. 2017
Geometric modeling and processing › shape representation › implicit representation
signed distance function
0.312017
An hp-Adaptive Discretization Algorithm for Signed Distance Field Generation · IEEE Trans. Vis. Comput. Graph. 2017
Geometric modeling and processing › shape modeling › parametric modeling
spline surfaces
0.312017
An hp-Adaptive Discretization Algorithm for Signed Distance Field Generation · IEEE Trans. Vis. Comput. Graph. 2017
Computer animation and physical simulation › fluid simulation
viscous fluid simulation
0.312017
Divergence-Free SPH for Incompressible and Viscous Fluids · IEEE Trans. Vis. Comput. Graph. 2017
Computer animation and physical simulation › fluid simulation › multiphase fluid simulation
foam simulation
0.112019
Turbulent Micropolar SPH Fluids with Foam · IEEE Trans. Vis. Comput. Graph. 2019
Geometric modeling and processing
collision detection
0.112017
An hp-Adaptive Discretization Algorithm for Signed Distance Field Generation · IEEE Trans. Vis. Comput. Graph. 2017
Computer animation and physical simulation › time integration
implicit time integration
0.112017
Robust eXtended finite elements for complex cutting of deformables · ACM Trans. Graph. 2017

Methods — techniques the papers use, named apart from their topics

implicit frictional boundary handling · 0.4density map · 0.4post-processing foam generation · 0.4micropolar material model · 0.4quadrature rules · 0.3preconditioner · 0.3implicit pressure solver · 0.3extended finite element method · 0.3error estimator · 0.3divergence-free velocity enforcement · 0.3
YearPublicationVenuePosition
2022 A Survey on SPH Methods in Computer Graphics
abstract
Abstract Throughout the past decades, the graphics community has spent major resources on the research and development of physics simulators on the mission to computer‐generate behaviors achieving outstanding visual effects or to make the virtual world indistinguishable from reality. The variety and impact of recent research based on Smoothed Particle Hydrodynamics (SPH) demonstrates the concept's importance as one of the most versatile tools for the simulation of fluids and solids. With this survey, we offer an overview of the developments and still‐active research on physics simulation methodologies based on SPH that has not been addressed in previous SPH surveys. Following an introduction about typical SPH discretization techniques, we provide an overview over the most used incompressibility solvers and present novel insights regarding their relation and conditional equivalence. The survey further covers recent advances in implicit and particle‐based boundary handling and sampling techniques. While SPH is best known in the context of fluid simulation we discuss modern concepts to augment the range of simulatable physical characteristics including turbulence, highly viscous matter, deformable solids, as well as rigid body contact handling. Besides the purely numerical approaches, simulation techniques aided by machine learning are on the rise. Thus, the survey discusses recent data‐driven approaches and the impact of differentiable solvers on artist control. Finally, we provide context for discussion by outlining existing problems and opportunities to open up new research directions.
Dan Koschier, Jan Bender, Barbara Solenthaler, Matthias Teschner
Comput. Graph. Forum1
2020 Implicit Frictional Boundary Handling for SPH
abstract
In this article, we present a novel method for the robust handling of static and dynamic rigid boundaries in Smoothed Particle Hydrodynamics (SPH) simulations. We build upon the ideas of the density maps approach which has been introduced recently by Koschier and Bender. They precompute the density contributions of solid boundaries and store them on a spatial grid which can be efficiently queried during runtime. This alleviates the problems of commonly used boundary particles, like bumpy surfaces and inaccurate pressure forces near boundaries. Our method is based on a similar concept but we precompute the volume contribution of the boundary geometry. This maintains all benefits of density maps but offers a variety of advantages which are demonstrated in several experiments. First, in contrast to the density maps method we can compute derivatives in the standard SPH manner by differentiating the kernel function. This results in smooth pressure forces, even for lower map resolutions, such that precomputation times and memory requirements are reduced by more than two orders of magnitude compared to density maps. Furthermore, this directly fits into the SPH concept so that volume maps can be seamlessly combined with existing SPH methods. Finally, the kernel function is not baked into the map such that the same volume map can be used with different kernels. This is especially useful when we want to incorporate common surface tension or viscosity methods that use different kernels than the fluid simulation.
Jan Bender, Tassilo Kugelstadt, Marcel Weiler, Dan Koschier
IEEE Trans. Vis. Comput. Graph.4
2019 Volume Maps: An Implicit Boundary Representation for SPH
abstract
In this paper, we present a novel method for the robust handling of static and dynamic rigid boundaries in Smoothed Particle Hydrodynamics (SPH) simulations. We build upon the ideas of the density maps approach which has been introduced recently by Koschier and Bender. They precompute the density contributions of solid boundaries and store them on a spatial grid which can be efficiently queried during runtime. This alleviates the problems of commonly used boundary particles, like bumpy surfaces and inaccurate pressure forces near boundaries. Our method is based on a similar concept but we precompute the volume contribution of the boundary geometry and store it on a grid. This maintains all benefits of density maps but offers a variety of advantages which are demonstrated in several experiments. Firstly, in contrast to the density maps method we can compute derivatives in the standard SPH manner by differentiating the kernel function. This results in smooth pressure forces, even for lower map resolutions, such that precomputation times and memory requirements are reduced by more than two orders of magnitude compared to density maps. Furthermore, this directly fits into the SPH concept so that volume maps can be seamlessly combined with existing SPH methods. Finally, the kernel function is not baked into the map such that the same volume map can be used with different kernels. This is especially useful when we want to incorporate common surface tension or viscosity methods that use different kernels than the fluid simulation.
Jan Bender, Tassilo Kugelstadt, Marcel Weiler, Dan Koschier
MIG4
2019 Turbulent Micropolar SPH Fluids with Foam
abstract
In this paper we introduce a novel micropolar material model for the simulation of turbulent inviscid fluids. The governing equations are solved by using the concept of Smoothed Particle Hydrodynamics (SPH). As already investigated in previous works, SPH fluid simulations suffer from numerical diffusion which leads to a lower vorticity, a loss in turbulent details and finally in less realistic results. To solve this problem we propose a micropolar fluid model. The micropolar fluid model is a generalization of the classical Navier-Stokes equations, which are typically used in computer graphics to simulate fluids. In contrast to the classical Navier-Stokes model, micropolar fluids have a microstructure and therefore consider the rotational motion of fluid particles. In addition to the linear velocity field these fluids also have a field of microrotation which represents existing vortices and provides a source for new ones. However, classical micropolar materials are viscous and the translational and the rotational motion are coupled in a dissipative way. Since our goal is to simulate turbulent fluids, we introduce a novel modified micropolar material for inviscid fluids with a non-dissipative coupling. Our model can generate realistic turbulences, is linear and angular momentum conserving, can be easily integrated in existing SPH simulation methods and its computational overhead is negligible. Another important visual feature of turbulent liquids is foam. Therefore, we present a post-processing method which considers microrotation in the foam particle generation. It works completely automatic and requires only one user-defined parameter to control the amount of foam.
Jan Bender, Dan Koschier, Tassilo Kugelstadt, Marcel Weiler
IEEE Trans. Vis. Comput. Graph.2
2018 Fast Corotated FEM using Operator Splitting
abstract
Abstract In this paper we present a novel operator splitting approach for corotated FEM simulations. The deformation energy of the corotated linear material model consists of two additive terms. The first term models stretching in the individual spatial directions and the second term describes resistance to volume changes. By formulating the backward Euler time integration scheme as an optimization problem, we show that the first term is invariant to rotations. This allows us to use an operator splitting approach and to solve both terms individually with different numerical methods. The stretching part is solved accurately with an optimization integrator, which can be done very efficiently because the system matrix is constant over time such that its Cholesky factorization can be precomputed. The volume term is solved approximately by using the compliant constraints method and Gauss‐Seidel iterations. Further, we introduce the analytic polar decomposition which allows us to speed up the extraction of the rotational part of the deformation gradient and to recover inverted elements. Finally, this results in an extremely fast and robust simulation method with high visual quality that outperforms standard corotated FEMs by more than two orders of magnitude and even the fast but inaccurate PBD and shape matching methods by more than one order of magnitude without having their typical drawbacks. This enables a very efficient simulation of complex scenes containing more than a million elements.
Tassilo Kugelstadt, Dan Koschier, Jan Bender
Comput. Graph. Forum2
2018 A Physically Consistent Implicit Viscosity Solver for SPH Fluids
abstract
Abstract In this paper, we present a novel physically consistent implicit solver for the simulation of highly viscous fluids using the Smoothed Particle Hydrodynamics (SPH) formalism. Our method is the result of a theoretical and practical in‐depth analysis of the most recent implicit SPH solvers for viscous materials. Based on our findings, we developed a list of requirements that are vital to produce a realistic motion of a viscous fluid. These essential requirements include momentum conservation, a physically meaningful behavior under temporal and spatial refinement, the absence of ghost forces induced by spurious viscosities and the ability to reproduce complex physical effects that can be observed in nature. On the basis of several theoretical analyses, quantitative academic comparisons and complex visual experiments we show that none of the recent approaches is able to satisfy all requirements. In contrast, our proposed method meets all demands and therefore produces realistic animations in highly complex scenarios. We demonstrate that our solver outperforms former approaches in terms of physical accuracy and memory consumption while it is comparable in terms of computational performance. In addition to the implicit viscosity solver, we present a method to simulate melting objects. Therefore, we generalize the viscosity model to a spatially varying viscosity field and provide an SPH discretization of the heat equation.
Marcel Weiler, Dan Koschier, Magnus Brand, Jan Bender
Comput. Graph. Forum2
2017 Robust eXtended finite elements for complex cutting of deformables
abstract
In this paper we present a robust remeshing-free cutting algorithm on the basis of the eXtended Finite Element Method (XFEM) and fully implicit time integration. One of the most crucial points of the XFEM is that integrals over discontinuous polynomials have to be computed on subdomains of the polyhedral elements. Most existing approaches construct a cut-aligned auxiliary mesh for integration. In contrast, we propose a cutting algorithm that includes the construction of specialized quadrature rules for each dissected element without the requirement to explicitly represent the arising subdomains. Moreover, we solve the problem of ill-conditioned or even numerically singular solver matrices during time integration using a novel algorithm that constrains non-contributing degrees of freedom (DOFs) and introduce a preconditioner that efficiently reuses the constructed quadrature weights. Our method is particularly suitable for fine structural cutting as it decouples the added number of DOFs from the cut's geometry and correctly preserves geometry and physical properties by accurate integration. Due to the implicit time integration these fine features can still be simulated robustly using large time steps. As opposed to this, the vast majority of existing approaches either use remeshing or element duplication. Remeshing based methods are able to correctly preserve physical quantities but strongly couple cut geometry and mesh resolution leading to an unnecessary large number of additional DOFs. Element duplication based approaches keep the number of additional DOFs small but fail at correct conservation of mass and stiffness properties. We verify consistency and robustness of our approach on simple and reproducible academic examples while stability and applicability are demonstrated in large scenarios with complex and fine structural cutting.
Dan Koschier, Jan Bender, Nils Thürey
ACM Trans. Graph.1
2017 Divergence-Free SPH for Incompressible and Viscous Fluids
abstract
In this paper we present a novel Smoothed Particle Hydrodynamics (SPH) method for the efficient and stable simulation of incompressible fluids. The most efficient SPH-based approaches enforce incompressibility either on position or velocity level. However, the continuity equation for incompressible flow demands to maintain a constant density and a divergence-free velocity field. We propose a combination of two novel implicit pressure solvers enforcing both a low volume compression as well as a divergence-free velocity field. While a compression-free fluid is essential for realistic physical behavior, a divergence-free velocity field drastically reduces the number of required solver iterations and increases the stability of the simulation significantly. Thanks to the improved stability, our method can handle larger time steps than previous approaches. This results in a substantial performance gain since the computationally expensive neighborhood search has to be performed less frequently. Moreover, we introduce a third optional implicit solver to simulate highly viscous fluids which seamlessly integrates into our solver framework. Our implicit viscosity solver produces realistic results while introducing almost no numerical damping. We demonstrate the efficiency, robustness and scalability of our method in a variety of complex simulations including scenarios with millions of turbulent particles or highly viscous materials.
Jan Bender, Dan Koschier
IEEE Trans. Vis. Comput. Graph.2
2017 An hp-Adaptive Discretization Algorithm for Signed Distance Field Generation
abstract
In this paper we present an hp-adaptive algorithm to generate discrete higher-order polynomial Signed Distance Fields (SDFs) on axis-aligned hexahedral grids from manifold polygonal input meshes. Using an orthonormal polynomial basis, we efficiently fit the polynomials to the underlying signed distance function on each cell. The proposed error-driven construction algorithm is globally adaptive and iteratively refines the SDFs using either spatial subdivision ( h-refinement) following an octree scheme or by cell-wise adaption of the polynomial approximation's degree ( p-refinement). We further introduce a novel decision criterion based on an error-estimator in order to decide whether to apply p- or h-refinement. We demonstrate that our method is able to construct more accurate SDFs at significantly lower memory consumption compared to previous approaches. While the cell-wise polynomial approximation will result in highly accurate SDFs, it can not be guaranteed that the piecewise approximation is continuous over cell interfaces. Therefore, we propose an optimization-based post-processing step in order to weakly enforce continuity. Finally, we apply our generated SDFs as collision detector to the physically-based simulation of geometrically highly complex solid objects in order to demonstrate the practical relevance and applicability of our method.
Dan Koschier, Crispin Deul, Magnus Brand, Jan Bender
IEEE Trans. Vis. Comput. Graph.1
2016 Projective fluids
abstract
We present a new method for particle based fluid simulation, using a combination of Projective Dynamics and Smoothed Particle Hydrodynamics (SPH). The Projective Dynamics framework allows the fast simulation of a wide range of constraints. It offers great stability through its implicit time integration scheme and is parallelizable in large parts, so that it can make use of modern multi core CPUs. Yet existing work only uses Projective Dynamics to simulate various kinds of soft bodies and cloth. We are the first ones to incorporate fluid simulation into the Projective Dynamics framework. Our proposed fluid constraints are derived from SPH and seamlessly integrate into the existing method. Furthermore, we adapt the solver to handle the constantly changing constraints that appear in fluid simulation. We employ a highly parallel matrix-free conjugate gradient solver, and thus do not require expensive matrix factorizations.
Marcel Weiler, Dan Koschier, Jan Bender
MIG2
2014 Position-based simulation of continuous materials
Jan Bender, Dan Koschier, Patrick Charrier, Daniel Weber 0001
Comput. Graph.2