This is a city planning problem. I\'m trying to order somerectangular buildings of given size within a lot, so that the building corners are always within a max distance D to the other buildings and
I\'m having serious problems solving a problem illustrated on the pic below. Let\'s say we have 3 points in 3D space (blue dots), and the some center of the triangle based on them (red dot - point P).
I want to be able to take a GPX track of a twisty road and have an algorithm count the number of corners. I guess it will have to be done comparing the \"bearings\" of subsequent tracks.
I am building a graph editor in C# where the user can place nodes and then connect them with either a directed or undirected edge. When finished, an A* pathfinding algorithm determines the best path b
This question already has answers here: 开发者_JS百科 Closed 11 years ago. Possible Duplicate: Finding whether a point lies inside a rectangle or not
I\'m working on a vector map editor and I have a set of elements, each of which specifies its bounding box within the view. As the mouse moves I want to highlight the first element whose bounding box
I\'m currently working on a problem where I need to properly order (using something like a right-hand rule) the nodes that make up a planar polygon in 3D space.My idea thus far is to construct a trans
Through 2 given points runs a line (K1 and K3). I want to compute (find) 2 others points (X1,X2), which are parallel to given points. Al开发者_Go百科so I have center point(K2) between first and last p
Giv开发者_如何学Cen 4 lines in 3D (represented as a couple of points), I want to find the point in space which minimizes the sum of distances between this point and every line.
Given is a 2D are with the polygons. I need to find out the polygons visible in a perpendicular line of sight from the a given line segme开发者_StackOverflow中文版nt lying within that area. e.g.
加载中,请稍侯......