An optimal algorithm for the minimum edge cardinality cut surface problem

  • Authors:
  • David E. Cardoze

  • Affiliations:
  • Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • Proceedings of the nineteenth annual symposium on Computational geometry
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The minimum edge cardinality cut surface problem is a problem in computational topology with applications to areas such as solid modeling, scientific visualization, medical imaging and computer graphics, where non-manifold surfaces need to be converted to manifold ones. This problem was first studied in [11] (see also [12]), where heuristics are proposed. However no guarantees regarding the quality of the cut surface constructed are provided. In this paper we present a linear time construction and show that the cut surface constructed has minimum edge cardinality.