To put this dissertation in a proper perspective, I feel it is important to give a little insight into
my background history and motivation for working in the field of physicsbased animation. As …

The irregular strip packing problem is a combinatorial optimization problem that requires to
place a given set of two-dimensional polygons within a rectangular container so that no …

Collision detection algorithms has been investigated since decades. Consequently, there
already exist a wide spectrum of different approaches. In this chapter, we give a broad …

Penalty approaches can be used to efficiently resolve collisions of dynamically simulated
rigid and deformable objects. These approaches compute penalty forces based on the …

This paper presents an extended local search algorithm (ELS) for the irregular strip packing
problem. It adopts two neighborhoods, swapping two given polygons in a placement and …

This paper presents a virtual generation method for the heterogeneous microstructure of
asphalt mixtures. The coarse aggregates used in the digital asphalt mixture were derived …

In industry, cutting various irregular pieces from a large raw material plate of a given size is
often necessary to minimize the number of raw material sheets used. This problem is known …

This article provides an extensive review of algorithms for constructing Minkowski sums and
differences of polygons and polyhedra, both convex and non-convex, commonly known as …

This paper examines the two-dimensional irregular multiple-size bin packing problem,
where the goal is to pack all the given irregular pieces into bins of various sizes such that the …

The irregular strip‐packing problem (ISP) requires a given set of non‐convex polygons to be
placed without overlap within a rectangular container having a fixed width and a variable …