Jump to content

Marching triangles

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 00:20, 30 November 2014 (clean up repetitive wording — saying it's better than Delaunay twice isn't really any more helpful than just saying it once.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer graphics, the problem of transforming a cloud of points on the surface of a three-dimensional object into a polygon mesh for the object can be solved by a technique called 'marching triangles. This provides a faster alternative to other methods for the same problem of surface reconstruction, based on Delaunay triangulation.[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.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Marching_triangles&oldid=635962547"