Jump to content

Marching triangles

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Y parfilko (talk | contribs) at 04:40, 3 September 2013 (Removed the phrase 'two-dimensional' to remove confusion. Replaced with 'polygon mesh' and added a link to the corresponding page. Added a sentence on general limitations of Delaunay triangulation.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer graphics, marching triangles is a technique for reconstructing a polygon mesh from an unstructured point cloud. Point clouds are typically generated from 3D laser scanning of real-world objects. In the past, accurate reconstruction methods employed Delaunay triangulations. However, Delaunay triangulation becomes inefficient for complex objects due to the large number of possible geometries. Newer techniques such as Marching Triangles and Ball-Pivoting employ a moving boundary front to reconstruct point cloud surfaces.

Such techniques are generally more efficient than Delaunay triangulation and may provide similar accuracy in reconstruction. [1] [2]

References

  1. ^ A. Hilton, AJ Stoddart, et al. Marching Triangles: Range Image Fusion for Complex Object Modeling. Image Processing, vol 1., pp. 381–384. Sep 1996.
  2. ^ Bernardini, Mittleman. The Ball-Pivoting Algorithm for Surface Reconstruction, IEEE Transactions of Visualization & Graphics. 1999.