Description: This is an implementation of a meshwarping algorithm, using polygon scan conversion with texture mapping to produce the warped image. On release of the mouse button after modifying the position of a vertex, the four affected polygons incident on the modified vertex are rendered with a relatively standard Bresenham incremental scanline conversion algorithm, using the initial fixed grid polygons of the image as textures to be mapped onto the new polygons. The algorithm is lossy, in that the texture mapping does not integrate areas of the source textures to produce pixel values. The texture mapping is also prone to distortion along the edges of adjacent polygons, which can produce unrealistic results. Vertex adjustments are reversible and idempotent. Ultimately, it's more toy than serious graphics tool...but fun nonetheless.
Resource Specification
Version:
-
Platform:
All
Price:
Free
Date Added:
31/10/2006
Last Updated:
31/10/2006
Author:
http://www.dt.org/html/meshwarp.html
Average Visitor Rating:4 (out of 5) Number of Ratings: 2 Votes
Visit Image MeshWarp `s Website
Refer
Write a Review!
Report This Link
Description: This is an implementation of a meshwarping algorithm, using polygon scan conversion with texture mapping to produce the warped image. On release of the mouse button after modifying the position of a vertex, the four affected polygons incident on the modified vertex are rendered with a relatively standard Bresenham incremental scanline conversion algorithm, using the initial fixed grid polygons of the image as textures to be mapped onto the new polygons. The algorithm is lossy, in that the texture mapping does not integrate areas of the source textures to produce pixel values. The texture mapping is also prone to distortion along the edges of adjacent polygons, which can produce unrealistic results. Vertex adjustments are reversible and idempotent. Ultimately, it's more toy than serious graphics tool...but fun nonetheless.
4 (out of 5)
