Given n squares with edge length l, how can I determine the minimum radius r of the circle so that I can distribute all squares evenly along the perimeter of the circle without them overlapping? (Cons
Given rectangle_A intersecting rectangle_B, which has a union defined such that it is the rectangle containing both rectangles, I want to determine the coordinates of the (not overlapping) rectangles
This is very programming related but a somewhat non-programming question. I am performing image scaling in a web based application and I need to maintain my image relative to a fixed location even tho
Let\'s imagine we have a plane with some points on it. We also have a circle of given radius. I need an algorithm that determines such position of the circle that it covers maximal possible number of
I\'m trying to add a snap-to-road function in my all custom made GPS software. There\'s a few thousand of roads with hundreds of thousands of nodes (lat-lon points). I have read all those snap to road
I have two squares, S1 = (x1,y1,x2,y2) and S2 = (a1,b1,a2,b2) I\'m looking for the A tra开发者_开发技巧nsformation matrix with which
I have a circle which is actually a latlon position with a radius measured in meters.开发者_如何学C And I also have a road A-B defined as two lat-lon positions. How do I find whether that road cross i
I\'ve go开发者_运维技巧t a PathGeometry that I\'ve built from a bunch of LineSegments, and I want to split it into two PathGeometries divided by a line intersecting down the middle of the geometry.Her
2D problem: I measure the position of the 3 ends of a triangle in a cartesian system. Now i move the system (triangle) to another cartesian system and measure the position of just two ends.
This question already has answers here: 开发者_如何转开发 Closed 12 years ago. Possible Duplicate:
加载中,请稍侯......