As an extension and partial answer to my thread I wrote a simple algorithm that given a set of points(with xy coordinates) can form a non self-intersecting polygon.
I extracted country outline data from somewhere and successfully managed to conve开发者_运维知识库rt it into an array of lat-lng coordinates that I can feed to Google maps API to draw polyline or poly
Closed. This question is opinion-based. It is not currently accepting answers. Want to improve this question? Update the question so it can be answered with facts and citations by editing
Is t开发者_高级运维here any function that will give me the intersection point of a Polygon and Line2D ?
I was wondering if there is any sort of Polygon.double because I need to input two double [] arrays and test whether another point is contained in the polygon.I saw another post about Path2D.double bu
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
i have created a table in mysql to store polygon data: CREATE TABLE geom (g GEOMETRY); And i inserted a polygon into it, using the following syntax:
I have a boolean[][] where the true indexes make up a solid polygon. With this information how can I
i have a typical question with the Geometric datatype of mysql, polygon. I have the polygon data, in the form of an a开发者_Go百科rray of latitudes and longitudes, ex:
I have a detailed 2D polygon (representing a geographic area) that is defined by a very large set of vertices. I\'m looking for an algorithm that will simplify and smooth the polygon, (reducing the nu
加载中,请稍侯......