It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current form. For help clari
I have some 2D points given and i want to draw a polygon using those points. This polygon must pass through all the given points means there is no such point which is inside or outside the polygon.
I\'d like to make a convex hull of a set of 2D points (in python).I\'ve found several examples which have helped, but I have an extra feature I\'d like that I haven\'t been able to implement.What I wa
Related to: Polygon Decomposition - Removing Concave Points to Form Convex Polygons I am looking for an algorithm to do the following:
I have two convex hulls and I wa开发者_运维百科s just wondering if anyone knows of any good algorithms or resources/ has any ideas on how to compare the position of one convex hull to another?
I\'m getting an attribute error using swig to wrap a c function for use in python code.I\'ve got other functions alongside chap that work just fine, but some strange reason this one will not work :/
I need an algorithm for calculating the convex hull of a set of points from the Voronoi Diagram of the points in O(n).The Voronoi diagram is contained in a bounding box and is stored as a doubly conne
Hi also consider that I have 4 points and I will have 4 triangles how can I check these four triangles for each point that is the pointwithin the triangles or not.
Hi I know that blind convex hull has o(n^4) but I hav开发者_StackOverflow社区e never seen its code! Is there any site that has its code?
I have a set of points. I want to separate them into 2 distinct sets. To do this, I choose two points (a and b) and draw an imaginary line between them. Now I want to have all points that are left fro
加载中,请稍侯......