I\'d like to cut a convex polygon into two with a given ratio of areas using a straight line, such that the larger aspect ratio of the two subpolygons is minimised.
I\'m working on a project that involves creating a spline from a defined set of points (tens of thousands of points).
This is a question similar to the one here, but I figure that it would be helpful if I can recast it in a more general terms.
I am looking for a good library (preferably in C/C++) that can calculate the intersections开发者_开发问答 between a line segment (ray) and a trimesh.
Let\'s say I\'ve got 1 million arbitrarily shaped, arbitrarily oriented N-dimensional ellipsoids scattered randomly through N-dimensional space.Given a sub set of ellipsoids, I want to \"quickly\" det
I\'m working on a data mining algorithm where i want to pick a random direction from a particular poin开发者_如何学JAVAt in the feature space.
I\'m working on a product which heavily relies on Geo-Data to map locations of \'places\' matching a certain criteria.
I have a set of dense, irregurarly distributed 2D points (\"scattered all over the place\"). They can be stored in a single MULTIPOINT WKT object including \"holes\" or - if needed - as delaunay trian
Suppose there\'s a set of 2D points to represent an initial simple polygon.开发者_JAVA百科 Now I want to optimize the positions of each point according to some cost function. But this could make the p
Given two sets of line segments (xa1..N,ya1..N) and (xb1..N,yb开发者_如何转开发1..N) that represent the upper and lower surfaces of a geology unit, and a known point (xc1,yc1) within the geology unit,
加载中,请稍侯......