A new grid-based midsurface generation algorithm

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review


A midsurface consists of surface elements (2D) representing three-dimensional, thin solids whose local thickness is small compared to its other dimensions. These simplified representations allow a significant acceleration of almost all physical simulations – a prerequisite for rapid prototyping in the context of 3D additive manufacturing. In this article we present a new algorithm that can extract a midsurface of a thin solid using a grid-based approach: The first step builds a binary 3D grid and marks each voxel that contains some part of the input surface geometry. The second step interprets the binary grid as a density field and applies a kernel to it. In the third step, the vertices of the original input data are moved within the density field towards the climax. Finally, vertices which approach each other are clustered and merged. Having merged all clusters of vertices, the resulting two-sided, incident surfaces are merged to one-sided surfaces. The result is a midsurface. The algorithm has been designed to run fully automatic and the presented proof of concept delivers convincing results.
Original languageEnglish
Title of host publicationHyperseeing - The Publication of the International Society of the Arts, Mathematics, and Architecture
Subtitle of host publicationProceedings of SMI'2020 Fabrication and Sculpting Event (FASE)
Publication statusPublished - 2 Jun 2020


  • midsurface
  • grid-based
  • voxel
  • simulation

ASJC Scopus subject areas

  • Computer Science Applications

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Application

Cite this