CGAL users discussion list

[Andreas Fabri <>]

On 27/05/2013 08:59, liudaisuda wrote:
> Thanks a lot for your suggestions. I have just done some research on your
> second suggestion, and I figure it is not quite suitable in my case. Could
> you please give me some references on how to discretize the polygon and
> function? Honesty, I have no idea what you are talking about. Thanks again.

You could use the mesh generator

http://doc.cgal.org/4.2/CGAL.CGAL.2D-Conforming-Triangulations-and-Meshes/html/index.html#title4

and the size of the triangles could even be determined
by the function, for example you could say that a triangle
with corner points p,q, and r, is too big and must be split,
because f(p), f(q), and f(r) are too different.

andreas


> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Area-of-convex-polygons-with-non-constant-density-tp4657579p4657584.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.


--
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri