here is a problem for you ;) I have a 3-dimensional array filled with 1s and 0s. The 1s represent 3 dimensional complex polygons ( not simple polygons ). Only the boundaries of the polygons have the
I would like to create polygon which shape are area that input by user. For example, user input Chicago. Then map will show polygon like below image :
Here is another geometric problem: I have created an 3-dimensional triangulated iso-surface of a point cloud using the marching cubes algorithm. Then I intersect this iso-surface with a plane and get
Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow.
I am trying to display a polygon on a mapview in android.I have created a custom overlay class(polygon) and overridden the draw method.After adding an instance of polygon to the mapview\'s overlay lis
I am trying to implement in C++ a function that determines the cut of any given polygon and pyramid. This has actually turned out to be far simpler than I had first imagin开发者_运维知识库ed.
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 have 2D polygons, with their vertices positioned in local polygon-space. I\'m trying to calculate new vertices that would form a uniform length edge around the inside of the polygon.
There is a strange behaviour in my OpenGL code. I want to draw a carpet on the ground. In the code below, if GROUND_SIZE is larger than 2071 and开发者_如何学JAVA CARPET_HEIGHT is smaller than 0.0003,
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
加载中,请稍侯......