Martin Magnusson wrote:
> 
> Does anyone know of a (good) algorithm to tesselate a 2D polygon?
> 
> At least I think tesselation is what I'm after - what I want to do is
> distributing points evenly inside a polygon with a certain maximum distance
> to each other (that is, tesselate(d) should fill the polygon with enogh
> points so that no points are more separated by more than d distance), and
> then make a triangular mesh out of it.
> 
> Any ideas?

http://xfactor.wpi.edu/Works/DCubanski/mva93h/subsection3_3_2.html

-- 
Ken Tyler -  1200+ Povray, Graphics, 3D Rendering, and Raytracing Links:
http://home.pacbell.net/tylereng/index.html http://www.povray.org/links/

Post a reply to this message