I am using PostgreSQL with the GIS exten开发者_如何学JAVAsion to store map data, together with OpenLayers, GeoServer etc. Given a polygon, e.g. of a neighborhood, I need to find all LAT/LONG points st
Is there a standard for this? Algorithm name? Say: I have 10 polygons of different sizes. I have an area of specific size.
I\'m using Delaunay to triangulate a concave polygon, but it fills in the concavities. How do I automatically remove the trian开发者_StackOverflowgles that are outside the polygon boundaries?Self-answ
The function below creates a polygon square out of 4 points and I assume the last 5th point closed the squar, I need it to have at least 24 points and to make up a circle. Any ideas?
i need to draw a polygon of \"n\" sides given 2 points (the center and 1 of his vertex) just that i suck in math. I have been reading a lot and all this is what i have been able to figure it (i dont k
I\'m stuck with this little problem and my algorithm to solve this doesn\'t hold for all cases. Does anybody has an id开发者_运维百科ea how to solve this?
I have a polygon determined by an Array of Points. This polygon is crossing itself making some holes in the polygon itself.
I\'m trying to draw a label on a polygon of an svg file. The problem I\'m facing is to find out roughly the center of this polygon to place the label, as the path\'s coordinates are in svg format and
I\'ve got a KML with 127 simple polygons in it. If I load them all in via GGeoXml then it\'s lightning fast, and when you zoom in/out it redraws开发者_开发知识库 all the polygons (just about) instant
OK, so I\'m trying to make a simple asteroids clone. Everything works fine, except for the collision detection.
加载中,请稍侯......