Thoroughly revised, this third edition focuses on modern techniques used to generate
synthetic three-dimensional images in a fraction of a second. With the advent of …

We propose a new tetrahedral meshing method, fTetWild, to convert triangle soups into high-
quality tetrahedral meshes. Our method builds on the TetWild algorithm, replacing the …

This contribution presents a brief survey of clipping and intersection algorithms in E 2 and E
3 with a nearly complete list of relevant references. Some algorithms use the projective …

We introduce a novel algorithm to transform any generic set of triangles in 3D space into a
well-formed simplicial complex. Intersecting elements in the input are correctly identified …

Study on the mechanical response and damage behavior of concrete, especially its
mesostructural failure mechanism, still remains an important issue in civil engineering and …

In this paper, we propose a numerical method for computing the signed distance function to
a discrete domain, on an arbitrary triangular background mesh. It mainly relies on the use of …

The triangle‐to‐triangle intersection test is a basic component of all collision detection data
structures and algorithms. This paper presents a fast method for testing whether two …

We introduce a robust and automatic algorithm to convert linear triangle meshes with feature
annotated into coarse tetrahedral meshes with curved elements. Our construction …

Several key techniques in 3D geological modeling including planar mesh generation,
spatial interpolation, and surface intersection are summarized in this paper. Note that these …

We introduce an algorithm to convert a self-intersection free, orientable, and manifold
triangle mesh T into a generalized prismatic shell equipped with a bijective projection …