A Simple and Fast Hole Detection Algorithm for Triangulated Surfaces

Research output: Contribution to journalArticleScientificpeer-review

3 Citations (Scopus)
32 Downloads (Pure)


We present a simple and fast algorithm for computing the exact holes in discrete two-dimensional manifolds embedded in a threedimensional Euclidean space. We deal with the intentionally created "through holes" or "tunnel holes" in the geometry as opposed to missing triangles. The algorithm detects the holes in the geometry directly without any simplified geometry approximation. Discrete Gaussian curvature is used for approximating the local curvature flow in the geometry and for removing outliers from the collection of feature edges. We present an algorithm with varying degrees of flexibility. The algorithm is demonstrated separately for sheets and solid geometries. This article demonstrates the algorithm on triangulated surfaces. However, the algorithm and the underlying data structure are also applicable for surfaces with mixed polygons.

Original languageEnglish
Article number4049030
Number of pages6
JournalJournal of Computing and Information Science in Engineering
Issue number4
Publication statusPublished - 2021

Bibliographical note

Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.


  • Computational geometry
  • Computer-aided design
  • Computer-aided engineering


Dive into the research topics of 'A Simple and Fast Hole Detection Algorithm for Triangulated Surfaces'. Together they form a unique fingerprint.

Cite this