Efficient Topology Construction from Triangle Soup

  • Authors:
  • Affiliations:
  • Venue:
  • GMP '04 Proceedings of the Geometric Modeling and Processing 2004
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Triangular mesh is one of the most popular shaperepresentations in computer graphics and the CAD/CAM/CAE area. In this paper we present a memory and timeefficient topology construction algorithm from trianglesoup, which is a set of triangles without connectivityinformation. The proposed algorithm consists of thefollowing steps: (1) vertex merging, (2) internal edgelinking, (3) multi-disk vertex splitting, and (4) boundarygap stitching. Typical triangle soup comes in the form ofan STL file, and topology construction work encountersnon-manifold cases for various causes, which should beconverted to 2-manifold models for many downstreamprocesses such as rapid prototyping and tool pathgeneration. The proposed algorithm uses a light-weightvertex-based data structure (adapted from a 'corner table'structure), and does not need to construct a full non-manifoldtopology information. The efficiency of theproposed algorithm is shown by empirical tests onpractical examples.