报告题目：Boundary‑constrained Hexahedral Mesh Generation

报告时间：2026年9月10日9：00

报告地点： 信息楼计算机广场报告厅

报告人：Kilian

报告内容：

In tetrahedral meshing pipelines, algorithms to recover faces and features from a target boundary are ubiquitous. Hexahedral mesh generation is different: a small change to the topological boundary usually requires global modifications to the mesh. In theory, the conditions required for the existence of a topological mesh (see Thurston 1993; Erickson 2014). In this talk, I present ongoing research to classify which quad meshes can be filled geometrically by trilinear hexahedral meshes. The proof is constructive and implemented as a meshing algorithm handling a wide variety of topological and geometric cases.

报告人简介：

Kilian, I completed my Master's and PhD degrees under the supervision of Prof. Jean‑François Remacle, at UC Louvain in Belgium. The algorithms I developed are now available through the open‑source meshing software, Gmsh. I've worked on hex‑dominant mesh generation, fast intersection algorithms for convex polytopes, and topological all‑hexahedral mesh generation.