Profile

Dan Koschier, M.Sc.
Room 203
Phone: +49 241 80 24083
Email: koschier@cs.rwth-aachen.de


Publications


Dan Koschier, Jan Bender, Nils Thuerey
ACM Transactions on Graphics (SIGGRAPH 2017)

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.

» Show BibTeX

@ARTICLE{ Koschier2017,
author= {Dan Koschier and Jan Bender and Nils Thuerey},
title= {{Robust eXtended Finite Elements for Complex Cutting of Deformables}},
year= {2017},
journal= {Transaction on Graphics (SIGGRAPH)},
publisher= {ACM},
volume = {36},
number = {4},
pages= {12}
}






Dan Koschier, Crispin Deul, Magnus Brand, Jan Bender
IEEE Transactions on Visualization and Computer Graphics

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.

» Show BibTeX

@Article{KDBB17,
author = {Koschier, Dan and Deul, Crispin and Brand, Magnus and Bender, Jan},
title = {An hp-Adaptive Discretization Algorithm for Signed Distance Field Generation},
journal = {IEEE Transactions on Visualization and Computer Graphics},
year = {2017},
volume = {23},
number = {10},
pages = {1--14},
issn = {1077-2626},
doi = {10.1109/TVCG.2017.2730202}
}






Jan Bender, Dan Koschier
IEEE Transactions on Visualization and Computer Graphics

In this paper we present a novel Smoo­thed Particle Hy­dro­dy­na­mics (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.

» Show BibTeX

@article{Bender2017,
author = {Jan Bender and Dan Koschier},
title = {Divergence-Free SPH for Incompressible and Viscous Fluids},
year = {2017},
journal = {IEEE Transactions on Visualization and Computer Graphics},
publisher = {IEEE},
year={2017},
volume={23},
number={3},
pages={1193-1206},
keywords={Smoothed Particle Hydrodynamics;divergence-free fluids;fluid simulation;implicit integration;incompressibility;viscous fluids},
doi={10.1109/TVCG.2016.2578335},
ISSN={1077-2626}
}






Jan Bender, Dan Koschier, Tassilo Kugelstadt, Marcel Weiler
ACM SIGGRAPH / EUROGRAPHICS Symposium on Computer Animation (Best Paper Award)

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.

» Show BibTeX

@INPROCEEDINGS{Bender2017,
author = {Jan Bender and Dan Koschier and Tassilo Kugelstadt and Marcel Weiler},
title = {A Micropolar Material Model for Turbulent SPH Fluids},
booktitle = {Proceedings of the 2017 ACM SIGGRAPH/Eurographics Symposium on Computer
Animation},
year = {2017},
publisher = {ACM}
}






Dan Koschier, Jan Bender
ACM SIGGRAPH / EUROGRAPHICS Symposium on Computer Animation

In this paper, we present the novel concept of density maps for robust handling of static and rigid dynamic boundaries in fluid simulations based on Smoothed Particle Hydrodynamics (SPH). In contrast to the vast majority of existing approaches, we use an implicit discretization for a continuous extension of the density field throughout solid boundaries. Using the novel representation we enhance accuracy and efficiency of density and density gradient evaluations in boundary regions by computationally efficient lookups into our density maps. The map is generated in a preprocessing step and discretizes the density contribution in the boundary's near-field. In consequence of the high regularity of the continuous boundary density field, we use cubic Lagrange polynomials on a narrow-band structure of a regular grid for discretization. This strategy not only removes the necessity to sample boundary surfaces with particles but also decouples the particle size from the number of sample points required to represent the boundary. Moreover, it solves the ever-present problem of particle deficiencies near the boundary. In several comparisons we show that the representation is more accurate than particle samplings, especially for smooth curved boundaries. We further demonstrate that our approach robustly handles scenarios with highly complex boundaries and even outperforms one of the most recent sampling based techniques.

» Show BibTeX

@InProceedings{KB17,
author = {Dan Koschier and Jan Bender},
title = {Density Maps for Improved SPH Boundary Handling},
booktitle = {Proceedings of the 2017 ACM SIGGRAPH/Eurographics Symposium on Computer Animation},
year = {2017},
series = {SCA '17},
pages = {1--10},
publisher = {ACM}
}






Dan Koschier, Crispin Deul, Jan Bender
ACM SIGGRAPH / EUROGRAPHICS Symposium on Computer Animation

In this paper we propose a novel method to construct hierarchical $hp$-adaptive Signed Distance Fields (SDFs). We discretize the signed distance function of an input mesh using piecewise polynomials on an axis-aligned hexahedral grid. Besides spatial refinement based on octree subdivision to refine the cell size (h), we hierarchically increase each cell's polynomial degree (p) in order to construct a very accurate but memory-efficient representation. Presenting a novel criterion to decide whether to apply h- or p-refinement, we demonstrate that our method is able to construct more accurate SDFs at significantly lower memory consumption than previous approaches. Finally, we demonstrate the usage of our representation as collision detector for geometrically highly complex solid objects in the application area of physically-based simulation.

» Show BibTeX

@INPROCEEDINGS{Koschier2016,
author = {Dan Koschier and Crispin Deul and Jan Bender},
title = {Hierarchical hp-Adaptive Signed Distance Fields},
booktitle = {Proceedings of the 2016 ACM SIGGRAPH/Eurographics Symposium on Computer
Animation},
year = {2016},
publisher = {Eurographics Association},
location = {Zurich, Switzerland}
}






Marcel Weiler, Dan Koschier, Jan Bender
ACM SIGGRAPH Motion in Games

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.

» Show BibTeX

@inproceedings{Weiler2016,
author = {Marcel Weiler and Dan Koschier and Jan Bender},
title = {Projective Fluids},
booktitle = {Proceedings of ACM SIGGRAPH Conference on Motion in Games},
series = {MIG '16},
year = {2016},
publisher = {ACM}
}






Jan Bender, Dan Koschier
ACM SIGGRAPH / EUROGRAPHICS Symposium on Computer Animation

In this paper we introduce an efficient and stable implicit SPH method for the physically-based simulation of incompressible fluids. In the area of computer graphics the most efficient SPH approaches focus solely on the correction of the density error to prevent volume compression. However, the continuity equation for incompressible flow also demands a divergence-free velocity field which is neglected by most methods. Although a few methods consider velocity divergence, they are either slow or have a perceivable density fluctuation.

Our novel method uses an efficient combination of two pressure solvers which enforce low volume compression (below 0.01%) and a divergence-free velocity field. This can be seen as enforcing incompressibility both on position level and velocity level. The first part is essential for realistic physical behavior while the divergence-free state increases the stability significantly and reduces the number of solver iterations. Moreover, it allows larger time steps which yields a considerable performance gain since particle neighborhoods have to be updated less frequently. Therefore, our divergence-free SPH (DFSPH) approach is significantly faster and more stable than current state-of-the-art SPH methods for incompressible fluids. We demonstrate this in simulations with millions of fast moving particles.

» Show BibTeX

@INPROCEEDINGS{Bender2015,
author = {Jan Bender and Dan Koschier},
title = {Divergence-Free Smoothed Particle Hydrodynamics},
booktitle = {Proceedings of the 2015 ACM SIGGRAPH/Eurographics Symposium on Computer
Animation},
year = {2015},
publisher = {ACM},
doi = {http://dx.doi.org/10.1145/2786784.2786796}
}






Dan Koschier, Sebastian Lipponer, Jan Bender
ACM SIGGRAPH / EUROGRAPHICS Symposium on Computer Animation

We present a method for the adaptive simulation of brittle fracture of solid objects based on a novel reversible tetrahedral mesh refinement scheme. The refinement scheme preserves the quality of the input mesh to a large extent, it is solely based on topological operations, and does not alter the boundary, i.e. any geometric feature. Our fracture algorithm successively performs a stress analysis and increases the resolution of the input mesh in regions of high tensile stress. This results in an accurate location of crack origins without the need of a general high resolution mesh which would cause high computational costs throughout the whole simulation. A crack is initiated when the maximum tensile stress exceeds the material strength. The introduced algorithm then proceeds by iteratively recomputing the changed stress state and creating further cracks. Our approach can generate multiple cracks from a single impact but effectively avoids shattering artifacts. Once the tensile stress decreases, the mesh refinement is reversed to increase the performance of the simulation. We demonstrate that our adaptive method is robust, scalable and computes highly realistic fracture results.

» Show BibTeX

@INPROCEEDINGS{Koschier2014,
author = {Dan Koschier and Sebastian Lipponer and Jan Bender},
title = {Adaptive Tetrahedral Meshes for Brittle Fracture Simulation},
booktitle = {Proceedings of the 2014 ACM SIGGRAPH/Eurographics Symposium on Computer
Animation},
year = {2014},
publisher = {Eurographics Association},
location = {Copenhagen, Denmark}
}






Jan Bender, Dan Koschier, Patrick Charrier, Daniel Weber
Computers & Graphics

We introduce a novel fast and robust simulation method for deformable solids that supports complex physical effects like lateral contraction, anisotropy or elastoplasticity. Our method uses a continuum-based formulation to compute strain and bending energies for two- and three-dimensional bodies. In contrast to previous work, we do not determine forces to reduce these potential energies, instead we use a position-based approach. This combination of a continuum-based formulation with a position-based method enables us to keep the simulation algorithm stable, fast and controllable while providing the ability to simulate complex physical phenomena lacking in former position-based approaches. We demonstrate how to simulate cloth and volumetric bodies with lateral contraction, bending, plasticity as well as anisotropy and proof robustness even in case of degenerate or inverted elements. Due to the continuous material model of our method further physical phenomena like fracture or viscoelasticity can be easily implemented using already existing approaches. Furthermore, a combination with other geometrically motivated methods is possible.

» Show BibTeX

@ARTICLE{Bender2014,
author = {Jan Bender and Dan Koschier and Patrick Charrier and Daniel Weber},
title = {Position-Based Simulation of Continuous Materials},
journal = {Computers \& Graphics },
year = {2014},
volume = {44},
pages = {1 - 10},
number = {0},
doi = {http://dx.doi.org/10.1016/j.cag.2014.07.004},
issn = {0097-8493}
}





Disclaimer Home Visual Computing institute RWTH Aachen University