I have seen many examples in various programming languages that are using the Douglas-Peucker polyline simplification algorithm to produce a GPolyline to be used on Google Maps.
I have an array of \"lines\" each defined by 2 points. I am 开发者_运维知识库working with only the line segments lying between those points. I need to search lines that could continue one another (rel
I have a mysql database that I\'m trying to populate from a text file. The contents of my file look like (as just some examples. there are thousands of rows)
I have a convex polygon P1 of N points. This polygon could be any shape or proportion (as long as it is still convex).
Trying to make a very simple boolean function that will find whether a line intersects a sphere. This did not seem to be what I want, even though the question was similar:
开发者_运维百科 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.
I\'m working with 3D mesh data, where I have lots of 3D triangles which I need to rotate to eliminate the Z value, converting it to a 2D triangle.
I want to find the minimum distance between two polygons with million number of vertices(not the minimum distance between their vertices). I have to find the 开发者_JS百科minimum of shortest distance
i want to refine a previous question: How do i project a sphere onto the screen? (2) gives a simple solution:
Ok so i have an api to a globe that I can only move by setting the x y z axis tilt. (the camera cannot move.) I need to be able to map lat/lng to it. So basically take lat/lng and 开发者_运维技巧rotat
加载中,请稍侯......