Jump to content

Marching triangles

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ridernyc (talk | contribs) at 16:40, 20 January 2010 (Reverted 1 edit by 70.168.212.117 identified as vandalism to last revision by Ridernyc. (TW)). 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 two-dimensional surface geometry 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, 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.