Marching Triangles

From Handwiki

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://handwiki.org/wiki/index.php?title=Marching_triangles&oldid=48523"

Categories: [Geometric algorithms] [Triangle geometry]


Download as ZWI file | Last modified: 06/28/2025 14:21:30 | 5 views
☰ Source: https://handwiki.org/wiki/Marching_triangles | License: CC BY-SA 3.0

ZWI is not signed. [what is this?]