To give you some more choices of libraries out there: Polyboolean. I never tried this one, but it looks promising: http://www.complex-a5.ru/polyboolean/index.html General Polygon Clipper. This one works very well in practice and does triangulation as well as clipping and holes holes: http://www.cs.man.ac.uk/~toby/alan/software/ My personal recommendation: Use the tesselation from the GLU (OpenGL Utility Library). The … Read more
Looks like what is described here http://en.wikipedia.org/wiki/Delaunay_triangulation : The problem of finding the Delaunay triangulation of a set of points in d-dimensional Euclidean space can be converted to the problem of finding the convex hull of a set of points in (d + 1)-dimensional space, by giving each point p an extra coordinate equal to … Read more
The coordinate system is set according to the image and the description on this webpage
The answers based on angles are cumbersome to implement and can’t be easily generalized to data in higher dimensions. A better approach is that mentioned in my and WimC’s answers here: given the distance matrix D(i, j), define M(i, j) = 0.5*(D(1, j)^2 + D(i, 1)^2 – D(i, j)^2) which should be a positive semi-definite … Read more
1.- The method used is Least Squares. There are more complex algorithms than this one. Still it is the most common one, as the other methods may fail in some cases (i.e. some others fails if points are on plane or on infinite). The method can be found in Multiple View Geometry in Computer Vision … Read more
For 3 control point Bezier curves I would: use triangles as primitives enlarge control points to include area around curve to avoid artifacts This way is fast and there is no problem to compute A’,B’,C’ from A,B,C and vice versa. If the scale is constant (for example scale=1.25) then the max usable curve thickness<=2.0*min(|control_point-M|)*(scale-1.0). For … Read more