On 25/1/13 5:42 AM, AlicVB wrote: > Hi, thanks for all the infos. > I've briefly looked, and my first conclusion is... I need to read it > again, but not at the end of a work day :) > All that is completely new for me (mesh, tessellate, quads...), and I > fear it will be too difficult... but let's try ! > > btw, can you point me to the page where there is the code on Paul Bourke > website ? (I think I've found the theory page, but if there is some > code...)
It's here, sorry, forgot the link. http://paulbourke.net/geometry/bezier/ Actually, this code evaluates the bezier patch into a quad mesh using a discrete, pre-defined number of steps. Not really what you need. A pretty easy to implement recursive approach is the one from Ed Catmull, a brief description is here (2. Recursive Subdivision of Bezier Patches): http://web.cs.wpi.edu/~matt/courses/cs563/talks/surface/bez_surf.html This has pseudo code which should be very straight to translate to C. .mm ------------------------------------------------------------------------------ Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current with LearnDevNow - 3,200 step-by-step video tutorials by Microsoft MVPs and experts. ON SALE this month only -- learn more at: http://p.sf.net/sfu/learnnow-d2d _______________________________________________ darktable-devel mailing list darktable-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/darktable-devel
